Hostname: page-component-7dd5485656-kp629 Total loading time: 0 Render date: 2025-10-29T21:40:24.287Z Has data issue: false hasContentIssue false
  • English
  • Français

A solution of the isomorphism problem for circulant graphs

Published online by Cambridge University Press:  13 January 2004

M. Muzychuk
M. Muzychuk
Affiliation:
Department of Computer Science and Mathematics, Netanya Academic College, 16 Kibbutz Galuyot Street, 42365 Netanya, Israel. E-mail: muzy@netanya.ac.il
Get access

Abstract

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.

Keywords

circulant graphsgraph isomorphismSchur rings05C60 (primary)05C2505E3020B25 (secondary)

Information

Type
Research Article
Information
Proceedings of the London Mathematical Society , Volume 88 , Issue 1 , January 2004 , pp. 1 - 41
Copyright
2004 London Mathematical Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable