The Rainbow Connection Number of the Power Graph of a Finite Group
The Rainbow Connection Number of the Power Graph of a Finite Group
复制标题
有限群幂图的彩虹联数
DOI：
10.1007/s00373-015-1665-8
复制
发表时间：
2016-07-01
影响因子：
0.7
通讯作者：
Wang, Kaishun
中科院分区：
文献类型：
--
作者：
Ma, Xuanlong;Feng, Min;Wang, Kaishun
This paper studies the rainbow connection number of the power graph of a finite group G. We determine the rainbow connection number of if G has maximal involutions or is nilpotent, and show that the rainbow connection number of is at most three if G has no maximal involutions. The rainbow connection numbers of power graphs of some nonnilpotent groups are also given.
