On the Diameter of Undirected Cayley Graphs of Finite Abelian Groups
Bela Bajnok, W. Kyle Beatty

TL;DR
This paper investigates the diameter of undirected Cayley graphs of finite abelian groups, providing a complete characterization for cyclic groups and partial results for noncyclic groups, advancing understanding of their structural properties.
Contribution
It offers a complete classification for cyclic groups and proposes a conjecture with partial results for noncyclic groups regarding Cayley graph diameters.
Findings
Complete characterization for cyclic groups
Partial results and conjecture for noncyclic groups
Advances understanding of Cayley graph diameters in abelian groups
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · graph theory and CDMA systems · Cellular Automata and Applications
