Finite groups whose commuting graph is split
Abstract
As a contribution to the study of graphs defined on groups, we show that for a finite group G the following statements are equivalent: the commuting graph of G is a split graph; the commuting graph of G is a threshold graph; either G is abelian, or G is a generalized dihedral group D(A)=⟨A,t:(∀a∈A)(at)2=1⟩ where A is an abelian group of odd order.
Citation
Ma , X & Cameron , P J 2024 , ' Finite groups whose commuting graph is split ' , Trudy Instituta Matematiki i Mekhaniki UrO RAN , vol. 30 , no. 1 , pp. 280-283 . https://doi.org/10.21538/0134-4889-2024-30-1-280-283
Publication
Trudy Instituta Matematiki i Mekhaniki UrO RAN
Status
Peer reviewed
ISSN
0134-4889Type
Journal article
Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.