Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorCameron, Peter J.
dc.contributor.authorJafari, Sayyed
dc.date.accessioned2020-04-01T10:30:02Z
dc.date.available2020-04-01T10:30:02Z
dc.date.issued2020-05
dc.identifier266979039
dc.identifierbee7e7a8-700f-4efd-a54a-fdf4b05155de
dc.identifier85083113798
dc.identifier000522695700001
dc.identifier.citationCameron , 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-zen
dc.identifier.issn0911-0119
dc.identifier.otherORCID: /0000-0003-3130-9505/work/71559946
dc.identifier.urihttps://hdl.handle.net/10023/19738
dc.descriptionFunding: EPSRC grant no EP/R014604/1.en
dc.description.abstractLet 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.
dc.format.extent10
dc.format.extent248659
dc.language.isoeng
dc.relation.ispartofGraphs and Combinatoricsen
dc.subjectPower graphen
dc.subjectConnectivityen
dc.subjectIndependence numberen
dc.subjectCyclicen
dc.subjectQA Mathematicsen
dc.subjectT-NDASen
dc.subject.lccQAen
dc.titleOn the connectivity and independence number of power graphs of groupsen
dc.typeJournal articleen
dc.contributor.institutionUniversity of St Andrews. Pure Mathematicsen
dc.contributor.institutionUniversity of St Andrews. Centre for Interdisciplinary Research in Computational Algebraen
dc.identifier.doi10.1007/s00373-020-02162-z
dc.description.statusPeer revieweden


This item appears in the following Collection(s)

Show simple item record