On bipartite distance-regular Cayley graphs with diameter $3$
Mojtaba Jazaeri

TL;DR
This paper characterizes bipartite distance-regular Cayley graphs with diameter 3, showing they can generally be constructed from a semidirect product of a group and Z2, with one potential exception.
Contribution
It provides a classification of such graphs, revealing their construction method and identifying a possible unique case.
Findings
Most bipartite distance-regular Cayley graphs with diameter 3 are constructed from a semidirect product of a group and Z2.
The paper identifies a potential exception to this construction.
The classification advances understanding of the structure of these graphs.
Abstract
In this paper, we show that every bipartite distance-regular Cayley graph with diameter can be constructed on the semidirect product of a group and , except possibly for one case.
Click any figure to enlarge with its caption.
Figure 1Peer 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
TopicsFinite Group Theory Research · graph theory and CDMA systems · Coding theory and cryptography
