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

From MaRDI portal
Revision as of 16:37, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 groupsA matrix ring with commuting graph of maximal diameterOn a construction by Giudici and Parker on commuting graphs of groupsDistances on the commuting graph of the ring of real matricesOn the lower bound for diameter of commuting graph of prime-square sized matricesOn the connectivity and independence number of power graphs of groupsThe Engel graph of a finite groupCommuting graph of CA−groupsA study of enhanced power graphs of finite groupsCommuting involution graphs in classical affine Weyl groupsGenerating sets consisting of pairwise conjugate elementsThe diameter of the commuting graph of a finite group with trivial centre.REALIZABILITY PROBLEM FOR COMMUTING GRAPHSCommuting involution graphs for 4-dimensional projective symplectic groupsUnnamed ItemThe non-commuting, non-generating graph of a nilpotent groupMaximal non-commuting sets in certain unipotent upper-triangular linear groupsGraphs defined on groupsPerfect commuting graphsOn the Diameters of Commuting Graphs Arising from Random Skew-Symmetric MatricesOn the diameters of commuting graphs of permutational wreath productsThe cyclic graph (deleted enhanced power graph) of a direct productOn groups covered by finitely many centralizers and domination number of the commuting graphsOn groups whose commuting graph on a transversal is strongly regularOn the soluble graph of a finite groupOn the connectivity and equality of some graphs on finite semigroupsGroups whose non-commuting graph on a transversal is planar or toroidalEXTENDING RESULTS OF MORGAN AND PARKER ABOUT COMMUTING GRAPHSThe 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