The power graph of a finite group

被引:185
作者
Cameron, Peter J. [1 ]
Ghosh, Shamik [2 ]
机构
[1] Queen Mary Univ London, Sch Math Sci, London E1 4NS, England
[2] Jadavpur Univ, Dept Math, Kolkata 700032, India
关键词
Group; Graph; Power; Isomorphism; SEMIGROUPS;
D O I
10.1016/j.disc.2010.02.011
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The power graph of a group is the graph whose vertex set is the group, two elements being adjacent if one is a power of the other. We observe that non-isomorphic finite groups may have isomorphic power graphs, but that finite abelian groups with isomorphic power graphs must be isomorphic. We conjecture that two finite groups with isomorphic power graphs have the same number of elements of each order. We also show that the only finite group whose automorphism group is the same as that of its power graph is the Klein group of order 4. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:1220 / 1222
页数:3
相关论文
共 7 条
[1]  
Bosak J., 1964, THEORY GRAPHS APPL, P119
[2]   Undirected power graphs of semigroups [J].
Chakrabarty, Ivy ;
Ghosh, Shamik ;
Sen, M. K. .
SEMIGROUP FORUM, 2009, 78 (03) :410-426
[3]  
Kelarev A.V., 1999, Contributions to general algebra, V12, P229
[4]   Directed graphs and combinatorial properties of semigroups [J].
Kelarev, AV ;
Quinn, SJ .
JOURNAL OF ALGEBRA, 2002, 251 (01) :16-26
[5]  
Soicher L. H., 2006, GRAPE PACKAGE GAP VE
[6]  
The GAP Group, 2020, GAP GROUPS ALGORITHM
[7]  
ZELINKA B, 1975, CZECH MATH J, V25, P171