The number of edges in power graph of finite groups

被引:1
作者
Jafari, S. H. [1 ]
机构
[1] Shahrood Univ Technol, Fac Math Sci, POB 3619995161-316, Shahrood, Iran
关键词
Power graph; solvable group; cyclic group;
D O I
10.1142/S1793557121500376
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let G be a finite groups. The power graph of G is a graph with vertex set G and two distinct element x, y are adjacent if one of them is power another. We give a short elementary proof for Gamma(Z(n)) has a maximum number edges in all groups of order n.
引用
收藏
页数:4
相关论文
共 6 条
[1]   Power Graphs: A Survey [J].
Abawajy, Jemal ;
Kelarev, Andrei ;
Chowdhury, Morshed .
ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2013, 1 (02) :125-147
[2]   Undirected power graphs of semigroups [J].
Chakrabarty, Ivy ;
Ghosh, Shamik ;
Sen, M. K. .
SEMIGROUP FORUM, 2009, 78 (03) :410-426
[3]   Edge-maximality of power graphs of finite cyclic groups [J].
Curtin, Brian ;
Pourgholi, G. R. .
JOURNAL OF ALGEBRAIC COMBINATORICS, 2014, 40 (02) :313-330
[4]   SOLVABILITY OF GROUPS OF ODD ORDER [J].
FEIT, W ;
THOMPSON, JG .
PACIFIC JOURNAL OF MATHEMATICS, 1963, 13 (03) :775-&
[5]  
Kelarev A. V., 2000, Contributions to General Algebra, V12, P229
[6]   On the Power Graph of a Finite Group [J].
Mirzargar, M. ;
Ashrafi, A. R. ;
Nadjafi-Arani, M. J. .
FILOMAT, 2012, 26 (06) :1201-1208