On distance-regular Cayley graphs on abelian groups
Stefko Miklavic, Primoz Sparl

TL;DR
This paper classifies all distance-regular Cayley graphs on finite abelian groups with specific generating sets, expanding understanding of their structure and properties.
Contribution
It provides a complete classification of distance-regular Cayley graphs on abelian groups under particular generating set conditions.
Findings
Complete classification of such graphs achieved
Identification of structural properties of the generating sets
Clarification of conditions for distance-regularity in Cayley graphs
Abstract
Let denote a finite abelian group with identity 1 and let denote an inverse-closed subset of , which generates and for which there exists , such that . In this paper we obtain the complete classification of distance-regular Cayley graphs for such pairs of and .
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
Topicsgraph theory and CDMA systems · Finite Group Theory Research · Graph theory and applications
