Proc. London Math. Soc.
Abstract of Paper PLMS 1441
The isomorphism problem for circulant graphs (Cayley graphs over the cyclic group) which has been open since 1967 is completely solved in this paper. The main result of the paper gives an efficient isomorphism criterion for circulant graphs of arbitrary order. This result also solves an isomorphism problem for colored circulant graphs and some classes of cyclic codes.
2000 Mathematical Subject Classification: 05C60 (primary), 05C25 05E30 20B25 (secondary).
Keywords: circulant graphs, graph isomorphism, Schur rings.
E-mail:
muzy@netanya.ac.il
| Back to top LMS Site Contents Home |
Editorial Control:
Alice Sharp asharp_plms@compuserve.com Last changed: 17 March 2003 |