The commuting graphs of certain cyclic-by-abelian groups
Abstract
Let G be a finite, non-abelian group of the form G = A N, where A ≤ G is abelian, and N G is cyclic. We prove that the commuting graph (G) of G is either a connected graph of diameter at most four, or the disjoint union of |G'| + 1 complete graphs. These results apply to all finite metacyclic groups, and to groups of square-free order in particular.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.