Can connected commuting graphs of finite groups have arbitrarily large diameter?
From MaRDI portal
Abstract: We present a family of finite, non-abelian groups and propose that there are members of this family whose commuting graphs are connected and of arbitrarily large diameter. If true, this would disprove a conjecture of Iranmanesh and Jafarzadeh. While unable to prove our claim, we present a heuristic argument in favour of it. We also present the results of simulations which yielded explicit examples of groups whose commuting graphs have all possible diameters up to and including 10. Previously, no finite group whose commuting graph had diameter greater than 6 was known.
Recommendations
- On the diameters of commuting graphs arising from random skew-symmetric matrices.
- On bounding the diameter of the commuting graph of a group.
- The diameters of commuting graphs of linear groups and matrix rings over the integers modulo \(m\)
- The diameter of the commuting graph of a finite group with trivial centre.
- EXTENDING RESULTS OF MORGAN AND PARKER ABOUT COMMUTING GRAPHS
Cited in
(2)
This page was built for publication: Can connected commuting graphs of finite groups have arbitrarily large diameter?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895217)