2000 character limit reached
The commuting graphs of certain cyclic-by-abelian groups
Published 28 May 2024 in math.GR | (2405.18103v2)
Abstract: Let $G$ be a finite, non-abelian group of the form $G = A N$, where $A \leq G$ is abelian, and $N \trianglelefteq G$ is cyclic. We prove that the commuting graph $\Gamma(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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.