Finite groups whose commuting graph is split

Xuanlong Ma*, Peter J. Cameron

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

19 Downloads (Pure)

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.
Original languageEnglish
Pages (from-to)280-283
JournalTrudy Instituta Matematiki i Mekhaniki UrO RAN
Volume30
Issue number1
DOIs
Publication statusPublished - 4 Mar 2024

Keywords

  • Commuting graph
  • Split graph
  • Threshold graph
  • Generalized dihedral group

Fingerprint

Dive into the research topics of 'Finite groups whose commuting graph is split'. Together they form a unique fingerprint.

Cite this