The rainbow connection number of the power graph of a finite group

preprint2015arXivOpen access

Abstract

This paper studies the rainbow connection number of the power graph ΓGΓ_G of a finite group GG. We determine the rainbow connection number of ΓGΓ_G if GG has maximal involutions or is nilpotent, and show that the rainbow connection number of ΓGΓ_G is at most three if GG has no maximal involutions. The rainbow connection numbers of power graphs of some nonnilpotent groups are also given.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.