Title of article
Distance-regular circulants
Author/Authors
Miklavi?، نويسنده , , ?tefko and Poto?nik، نويسنده , , Primo?، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
8
From page
777
To page
784
Abstract
A classification of strongly regular Cayley graphs of cyclic group was independently achieved by Bridges and Mena (Ars Combin. 8 (1979) 143), Hughes, van Lint and Wilson (Announcement at the Seventh British Combinatorial Conference (1979)), and Ma (Discrete Math. 52 (1984) 75). Here we discuss their results in a more general setting of distance-regular Cayley graphs, and give the complete classification of distance-regular Cayley graphs of cyclic groups. In particular, we prove that a Cayley graph of a cyclic group is distance-regular if and only if it is isomorphic to a cycle, or a complete graph, or a complete multipartite graph, or a complete bipartite graph on a twice an odd number of vertices with a matching removed, or the Paley graph with a prime number of vertices.
Journal title
European Journal of Combinatorics
Serial Year
2003
Journal title
European Journal of Combinatorics
Record number
1549986
Link To Document