Abstract
This paper studies the rainbow connection number of the power graph of a finite group . We determine the rainbow connection number of if has maximal involutions or is nilpotent, and show that the rainbow connection number of is at most three if has no maximal involutions. The rainbow connection numbers of power graphs of some nonnilpotent groups are also given.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.