Skip to main content

Can connected commuting graphs of finite groups have arbitrarily large diameter?

  • Conference paper
Geometry, Structure and Randomness in Combinatorics

Part of the book series: CRM Series ((CRMSNS,volume 18))

  • 612 Accesses

Abstract

We present a two-parameter family, of finite, non-abelian random groups and propose that, for each fixed k, as m → ∞ the commuting graph of G m,k is almost surely connected and of diameter k. As well as being of independent interest, our groups would, if our conjecture is true, provide a large family of counterexamples to the conjecture of Iranmanesh and Jafarzadeh that the commuting graph of a finite group, if connected, must have a bounded diameter.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 24.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 34.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Alon and J. Spencer, “The Probabilistic Method” (2nd edition), Wiley, 2000.

    Google Scholar 

  2. M. Giudici and C. W. Parker, There is no upper bound for the diameter of the commuting graph of a finite group, J. Combin. Theory Ser. A 120, no. 7 (2013), 1600–1603.

    Article  MathSciNet  Google Scholar 

  3. M. Giudici and A. Pope, On bounding the diameter of the commuting graph of a group, J. Group Theory. 17, no. 1 (2013), 131–149.

    MathSciNet  Google Scholar 

  4. P. Hegarty and D. Zhelezov, On the Diameters of Commuting Graphs Arising from Random Skew-Symmetric Matrices, Combin. Probab. Comput. 23, no. 3 (2014), 449–459.

    Article  MATH  MathSciNet  Google Scholar 

  5. A. Iranmanesh and A. Jafarzadeh, On the commuting graph associated with the symmetric and alternating groups, J. Algebra Appl. 7, no. 1 (2008), 129–146.

    Article  MATH  MathSciNet  Google Scholar 

  6. G. L. Morgan and C. W. Parker, The diameter of the commuting graph of a finite group with trivial centre, J. Algebra 393 (2013), 41–59.

    Article  MATH  MathSciNet  Google Scholar 

  7. B. H. Neumann, A problem of Paul Erdős on groups, J. Austral. Math. Soc. Ser. A 21 (1976), 467–472.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Scuola Normale Superiore Pisa

About this paper

Cite this paper

Hegarty, P., Zhelezov, D. (2014). Can connected commuting graphs of finite groups have arbitrarily large diameter?. In: Matoušek, J., Nešetřil, J., Pellegrini, M. (eds) Geometry, Structure and Randomness in Combinatorics. CRM Series, vol 18. Edizioni della Normale, Pisa. https://doi.org/10.1007/978-88-7642-525-7_8

Download citation

Publish with us

Policies and ethics