On the Diameter of Undirected Cayley Graphs of Finite Abelian Groups
arXiv:2406.04045 · doi:10.2140/cnt.2025.14.1
Abstract
Let be a positive integer. Our goal is to find all finite abelian groups that contain a -subset for which the undirected Cayley graph has diameter at most . We provide a complete answer when is cyclic, and a conjecture and some partial answers when is noncyclic.