2022/02/07 by Xueyi Huang, Kinkar Chandra Das, Huang, Xueyi +3
Computer Science · Engineering · Mathematics · #05C25 #05E30 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2202.02939
openalex publication_date 2022/02/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The characterization of distance-regular Cayley graphs originated from the problem of identifying strongly regular Cayley graphs, or equivalently, regular partial difference sets. In this paper, a classification of distance-regular Cayley graphs on dicyclic groups is obtained. More specifically, it is shown that every distance-regular Cayley graph on a dicyclic group is a complete graph, a complete multipartite graph, or a non-antipodal bipartite distance-regular graph with diameter 3 satisfying some additional conditions.