There is no upper bound for the diameter of the commuting graph of a finite group
From MaRDI portal
Publication:2349191
DOI10.1016/j.jcta.2013.05.008zbMath1314.05055arXiv1210.0348OpenAlexW2594692962MaRDI QIDQ2349191
Michael Giudici, Christopher Parker
Publication date: 19 June 2015
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.0348
Related Items (29)
Perfect codes and universal adjacency spectra of commuting graphs of finite groups ⋮ A matrix ring with commuting graph of maximal diameter ⋮ On a construction by Giudici and Parker on commuting graphs of groups ⋮ Distances on the commuting graph of the ring of real matrices ⋮ On the lower bound for diameter of commuting graph of prime-square sized matrices ⋮ On the connectivity and independence number of power graphs of groups ⋮ The Engel graph of a finite group ⋮ Commuting graph of CA−groups ⋮ A study of enhanced power graphs of finite groups ⋮ Commuting involution graphs in classical affine Weyl groups ⋮ Generating sets consisting of pairwise conjugate elements ⋮ The diameter of the commuting graph of a finite group with trivial centre. ⋮ REALIZABILITY PROBLEM FOR COMMUTING GRAPHS ⋮ Commuting involution graphs for 4-dimensional projective symplectic groups ⋮ Unnamed Item ⋮ The non-commuting, non-generating graph of a nilpotent group ⋮ Maximal non-commuting sets in certain unipotent upper-triangular linear groups ⋮ Graphs defined on groups ⋮ Perfect commuting graphs ⋮ On the Diameters of Commuting Graphs Arising from Random Skew-Symmetric Matrices ⋮ On the diameters of commuting graphs of permutational wreath products ⋮ The cyclic graph (deleted enhanced power graph) of a direct product ⋮ On groups covered by finitely many centralizers and domination number of the commuting graphs ⋮ On groups whose commuting graph on a transversal is strongly regular ⋮ On the soluble graph of a finite group ⋮ On the connectivity and equality of some graphs on finite semigroups ⋮ Groups whose non-commuting graph on a transversal is planar or toroidal ⋮ EXTENDING RESULTS OF MORGAN AND PARKER ABOUT COMMUTING GRAPHS ⋮ The commuting graph of the symmetric inverse semigroup
This page was built for publication: There is no upper bound for the diameter of the commuting graph of a finite group