On bipartite distance-regular Cayley graphs with diameter 3

2019/04/14 by Mojtaba Jazaeri, Jazaeri, Mojtaba
Mathematics · Engineering · Computer Science · #Finite Group Theory Research #graph theory and CDMA systems #Coding theory and cryptography

paper · pdf · doi:10.48550/arxiv.1904.06696

Abstract

In this paper, we show that every bipartite distance-regular Cayley graph with diameter 3 can be constructed on the semidirect product of a group and ℤ₂, except possibly for one case.

Related

• On bipartite distance-regular Cayley graphs with small diameter
• Distance-regular Cayley graphs over dicyclic groups
• Distance-regular Cayley graphs over ℤ_p^s⊕ℤ_p
• Distance-regular Cayley graphs over (pseudo-) semi-dihedral groups
• Fourier analysis on distance-regular Cayley graphs over abelian groups