Recognizing Circulant Graphs of Prime Order in Polynomial Time

13 years 4 months ago

Download www.combinatorics.org

A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iﬀ its vertices can be ordered such that the corresponding adjacency matrix becomes a circulant matrix. To each circulant graph we may associate a coherent conﬁguration A and, in particular, a Schur ring S isomorphic to A. A can be associated without knowing G to be circulant. If n is prime, then by investigating the structure of A either we are able to ﬁnd an appropriate ordering of the vertices proving that G is circulant or we are able to prove that a certain necessary condition for G being circulant is violated. The algorithm we propose in this paper is a recognition algorithm for cyclic association schemes. It runs in time polynomial in n. MR Subject Number: 05C25, 05C85, 05E30

Mikhail E. Muzychuk, Gottfried Tinhofer

Real-time Traffic