There is no upper bound for the diameter of the commuting graph of a finite group

Michael Giudici*, Chris Parker

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

20 Citations (Scopus)

Abstract

We construct a family of finite 2-groups which have commuting graph of increasing diameter.

Original languageEnglish
Pages (from-to)1600-1603
Number of pages4
JournalJournal of Combinatorial Theory. Series A
Volume120
Issue number7
DOIs
Publication statusPublished - 1 Sept 2013

Keywords

  • Commuting graph
  • Diameter
  • Special p-group

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'There is no upper bound for the diameter of the commuting graph of a finite group'. Together they form a unique fingerprint.

Cite this