加载中…
In [Distrance-regular Cayley graphs on dihedral groups, J. Combin. Theory Ser B 97 (2007) 14–33], Miklavič and Potočnik proposed the problem of characterizing distance-regular Cayley graphs, which can be viewed as an extension of the problem of identifying strongly regular Cayley graphs, or equivalently, regular partial difference sets. In this paper, all distance-regular Cayley graphs over with being an odd prime are determined. It is shown that every such graph is isomorphic to a complete graph, a complete multipartite graph, or the line graph of a transversal design with .

生成讲解博客的中文版本

生成AI智能校验的中文版本