REALIZABILITY PROBLEM FOR COMMUTING GRAPHS

DOI10.1017/S1446788716000148zbMath1360.05076arXiv1505.05397MaRDI QIDQ2976238

Bojan Kuzma, Michael Giudici

Publication date: 28 April 2017

Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.05397

zbMATH Keywords

finite groupsfinite semigroupsclassification problemcommuting graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Abstract finite groups (20D99) Semigroups (20M99)

Related Items (1)

Commuting involution graphs for 4-dimensional projective symplectic groups

Uses Software

• Magma

Cites Work

• Minimal paths in the commuting graphs of semigroups
• On groups of even order
• The Magma algebra system. I: The user language
• The commuting graph of bounded linear operators on a Hilbert space
• Universal commutator graphs
• 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.
• Classification of Finite Groups with a CC-Subgroup
• Simple groups are characterized by their non-commuting graphs
• Planar, Toroidal, and Projective Commuting and Noncommuting Graphs
• On finite groups whose 2-Sylow subgroups have cyclic subgroups of index 2
• Finite groups with a self-centralizing subgroup of order 4
• Finite Groups which Contain a Selfcentralizing Subgroup of Order 3
• On Finite Groups with Given Conjugate Types I

This page was built for publication: REALIZABILITY PROBLEM FOR COMMUTING GRAPHS