Abstract

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 .

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call