2000 character limit reached
On the Diameter of Undirected Cayley Graphs of Finite Abelian Groups
Published 6 Jun 2024 in math.CO, math.GR, and math.NT | (2406.04045v1)
Abstract: Let $s$ be a positive integer. Our goal is to find all finite abelian groups $G$ that contain a $2$-subset $A$ for which the undirected Cayley graph $\Gamma(G,A)$ has diameter at most $s$. We provide a complete answer when $G$ is cyclic, and a conjecture and some partial answers when $G$ is noncyclic.
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.