The rainbow connection number of the power graph of a finite group
Abstract
This paper studies the rainbow connection number of the power graph G of a finite group G. We determine the rainbow connection number of G if G has maximal involutions or is nilpotent, and show that the rainbow connection number of G is at most three if G has no maximal involutions. The rainbow connection numbers of power graphs of some nonnilpotent groups are also given.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.