Distance-regular Cayley graphs over ℤpˢ ⊕ ℤpZhan, Xiongfeng (Avtor) Lu, Lu (Avtor) Huang, Xueyi (Avtor) distance-regular graphCayley graphSchur ringFourier transformationtransversal designIn 2007, 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. Let p be an odd prime. In this paper, all distance-regular Cayley graphs over ℤps ⊕ ℤp are identified. 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.Založba Univerze na Primorskem20252025-10-21 11:57:23Članek v reviji21977UDK: 519.17eISSN: 1855-3974DOI: https://doi.org/10.26493/1855-3974.3242.12bsl