On the Diameter of Undirected Cayley Graphs of Finite Abelian Groups
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 (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.
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.