{"paper":{"title":"The rainbow connection number of enhanced power graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel G. Mendoza, Luis A. Dupont, Miriam Rodr\\'iguez","submitted_at":"2017-08-25T01:56:58Z","abstract_excerpt":"Let $G$ be a finite group, the enhanced power graph of $G$, denoted by $\\Gamma_G^e$, is the graph with vertex set $G$ and two vertices $x,y$ are edge connected in $\\Gamma_{G}^e$ if there exist $z\\in G$ such that $x,y\\in\\langle z\\rangle$. Let $\\zeta$ be a edge-coloring of $\\Gamma_G^e$. In this article, we calculate the rainbow connection number of the enhanced power graph $\\Gamma_G^e$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07598","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}