On the Diameters of Commuting Graphs Arising from Random Skew-Symmetric Matrices

DOI10.1017/S0963548313000655zbMath1296.20067OpenAlexW2103684175MaRDI QIDQ5418811

Dmitrii Zhelezov, Peter V. Hegarty

Publication date: 28 May 2014

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548313000655

zbMATH Keywords

random graphscommuting graphsconnected graphsfinite random groups

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40) Probabilistic methods in group theory (20P05)

Related Items (2)

A study of enhanced power graphs of finite groups ⋮ Perfect commuting graphs

Cites Work

• Anisotropic groups of type \(A_n\) and the commuting graph of finite simple groups.
• On groups of even order
• There is no upper bound for the diameter of the commuting graph of a finite group
• The diameter of the commuting graph of a finite group with trivial centre.
• ON THE COMMUTING GRAPH ASSOCIATED WITH THE SYMMETRIC AND ALTERNATING GROUPS
• Diameters of Random Graphs
• The Diameter of Sparse Random Graphs

This page was built for publication: On the Diameters of Commuting Graphs Arising from Random Skew-Symmetric Matrices