There is no upper bound for the diameter of the commuting graph of a finite group
From MaRDI portal
Publication:2349191
Abstract: We construct a family of finite special 2-groups which have commuting graph of increasing diameter
Cited in
(38)- Distances on the commuting graph of the ring of real matrices
- The cyclic graph (deleted enhanced power graph) of a direct product
- On the soluble graph of a finite group
- On the connectivity and equality of some graphs on finite semigroups
- On a construction by Giudici and Parker on commuting graphs of groups
- On the connectivity and independence number of power graphs of groups
- The non-commuting, non-generating graph of a nilpotent group
- On the diameters of commuting graphs of permutational wreath products
- On groups whose commuting graph on a transversal is strongly regular
- The commuting graph of the symmetric inverse semigroup
- The diameter of the commuting graph of a finite group with trivial centre.
- The Engel graph of a finite group
- A matrix ring with commuting graph of maximal diameter
- Generating sets consisting of pairwise conjugate elements
- Realizability problem for commuting graphs
- EXTENDING RESULTS OF MORGAN AND PARKER ABOUT COMMUTING GRAPHS
- On the lower bound for diameter of commuting graph of prime-square sized matrices
- Graphs defined on groups
- A study of enhanced power graphs of finite groups
- Commuting involution graphs in classical affine Weyl groups
- On groups covered by finitely many centralizers and domination number of the commuting graphs
- Maximal non-commuting sets in certain unipotent upper-triangular linear groups
- Perfect commuting graphs
- On the diameters of commuting graphs arising from random skew-symmetric matrices.
- Groups whose non-commuting graph on a transversal is planar or toroidal
- Perfect codes and universal adjacency spectra of commuting graphs of finite groups
- Commuting involution graphs for 4-dimensional projective symplectic groups
- Commuting graph of CA−groups
- A graph related to the sum of element orders of a finite group
- A survey on conjugacy class graphs of groups
- On the difference of the enhanced power graph and the power graph of a finite group
- The commuting graph of a solvable A-group
- The commuting graphs of certain cyclic-by-abelian groups
- Commuting graphs of completely simple semigroups
- Poisson approximation for large permutation groups
- On the diameter of a super-order-commuting graph
- Probabilistic properties of profinite groups
- Aspects of the commuting graph
This page was built for publication: There is no upper bound for the diameter of the commuting graph of a finite group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2349191)