Answers are grounded in this paper and cite their sources.
Let G be a finite group. The enhanced power graph Γ G e of G is the graph with vertex set G and two distinct vertices are adjacent if they generate a cyclic subgroup of G. In this article, we calculate the rainbow connection number of Γ G e .
No takes yet. Share an insight, caveat, or question.
Dupont et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: