On the connectivity and independence number of power graphs of groups
Date
05/2020Metadata
Show full item recordAbstract
Let G be a group. The power graph of G is a graph with vertex set G in which two distinct elements x,y are adjacent if one of them is a power of the other. We characterize all groups whose power graphs have finite independence number, show that they have clique cover number equal to their independence number, and calculate this number. The proper power graph is the induced subgraph of the power graph on the set G-{1}. A group whose proper power graph is connected must be either a torsion group or a torsion-free group; we give characterizations of some groups whose proper power graphs are connected.
Citation
Cameron , P J & Jafari , S 2020 , ' On the connectivity and independence number of power graphs of groups ' , Graphs and Combinatorics , vol. 36 , pp. 895–904 . https://doi.org/10.1007/s00373-020-02162-z
Publication
Graphs and Combinatorics
Status
Peer reviewed
ISSN
0911-0119Type
Journal article
Description
Funding: EPSRC grant no EP/R014604/1.Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.