Extending Morgan and Parker's results about commuting graphs
Nicolas F. Beike, Rachel Carleton, David G. Costanzo, Colin Heath,, Mark L. Lewis, Kaiwen Lu, and Jamie D. Pearce

TL;DR
This paper extends previous results on the structure of commuting graphs in groups by relaxing conditions on the center and derived subgroup, and characterizes the connectivity and diameter of these graphs under new assumptions.
Contribution
It generalizes Morgan and Parker's results by replacing the condition Z(G)=1 with G' ∩ Z(G)=1 and explores the connectivity of commuting graphs in solvable groups with specific quotient structures.
Findings
Replacing Z(G)=1 with G' ∩ Z(G)=1 broadens the applicability of the results.
Connected commuting graphs of certain solvable groups have diameter at most 8.
Disconnection of commuting graphs occurs in solvable groups with specific quotient structures.
Abstract
Morgan and Parker have proved that if is a group satisfying the condition that , then the connected components of the commuting graph of have diameter at most . Parker has proved that if in addition is solvable, then the commuting graph of is disconnected if and only if is a Frobenius group or a -Frobenius group, and if the commuting graph of is connected, then its diameter is at most . We prove that the hypothesis in these results can be replaced with . We also prove that if is solvable and is either a Frobenius group or a -Frobenius group, then the commuting graph of is disconnected.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Coding theory and cryptography
