Distance-regular Cayley graphs over $\mathbb{Z}_{p^s}\oplus\mathbb{Z}_{p}$
Combinatorics
2023-08-29 v1
Abstract
In [Distrance-regular Cayley graphs on dihedral groups, J. Combin. Theory Ser B 97 (2007) 14--33], Miklavi\v{c} and Poto\v{c}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 .
Cite
@article{arxiv.2308.14368,
title = {Distance-regular Cayley graphs over $\mathbb{Z}_{p^s}\oplus\mathbb{Z}_{p}$},
author = {Xiongfeng Zhan and Lu Lu and Xueyi Huang},
journal= {arXiv preprint arXiv:2308.14368},
year = {2023}
}
Comments
19 pages. arXiv admin note: substantial text overlap with arXiv:2202.02939