Distance-regular Cayley graphs over Zpsp

Abstract

In [Distrance-regular Cayley graphs on dihedral groups, J. Combin. Theory Ser B 97 (2007) 14--33], Miklavic and Potocnik 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 Zpsp with p 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 TD(r,p) with 2≤ r≤ p-1.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…