Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes

In this paper we present a time-polynomial recognition algorithm for certain classes of circulant graphs. Our approach uses coherent configurations and Schur rings generated by circulant graphs for elucidating their symmetry properties and eventually finding a cyclic automorphism.

[1]  Michael Sampels.  Cayley Graphs as Interconnection Networks: A Case Study , 1996, Parcella.

[2]  Ka Hin Leung,et al.  On schur rings over cyclic groups , 1998 .

[3]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[4]  D. G. Higman.  Coherent configurations , 1975 .

[5]  H. Wielandt,et al.  Finite Permutation Groups , 1964 .

[6]  Peter J. Cameron,et al.  Designs, graphs, codes, and their links , 1991 .

[7]  E. Bannai,et al.  Algebraic Combinatorics I: Association Schemes , 1984 .

[8]  Luitpold Babel,et al.  STABCOL: Graph Isomorphism Testing Based on the Weisfeiler-Leman Algorithm , 1997 .

[9]  M. Klin,et al.  The König problem, the isomorphism problem for cyclic graphs and the characterization of Schur rings , 1978 .

[10]  A. Neumaier,et al.  Distance Regular Graphs , 1989 .

[11]  J. H. Lint,et al.  Designs, graphs, codes, and their links , 1991 .

[12]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[13]  I. A. Faradzhev.  Investigations in Algebraic Theory of Combinatorial Objects , 1994 .

[14]  Noboru Ito.  Hadamard Tournaments with Transitive Automorphism Groups , 1984, Eur. J. Comb..

[15]  I. Ponomarenko.  Polynomial time algorithms for recognizing and isomorphism testing of cyclic tournaments , 1992 .

[16]  Kyung-Yong Chwa,et al.  Recursive circulant: a new topology for multicomputer networks (extended abstract) , 1994, Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN).

[17]  M. Klin,et al.  Algebraic Combinatorics in Mathematical Chemistry. Methods and Algorithms. III. Graph Invariants and , 1999 .

[18]  Alexander A. Ivanov,et al.  Galois correspondence between permutation groups and cellular rings (association schemes) , 1990, Graphs Comb..

[19]  Eiichi Bannai,et al.  Character Tables of Fission Schemes and Fusion Schemes , 1993, Eur. J. Comb..

[20]  Mikhail E. Muzychuk,et al.  Recognizing Circulant Graphs of Prime Order in Polynomial Time , 1998, Electron. J. Comb..

[21]  Oliver Bastert,et al.  Stabilization procedures and applications , 2001 .

[22]  G. Sabidussi,et al.  Graph symmetry : algebraic methods and applications , 1997 .

[23]  Alexander A. Ivanov,et al.  Investigations in Algebraic Theory of Combinatorial Objects , 1994 .

[24]  M. Klin,et al.  Cellular Rings and Groups of Automorphisms of Graphs , 1994 .

[25]  Ilia Ponomarenko,et al.  On Primitive Cellular Algebras , 1997 .

[26]  B. Weisfeiler.  On construction and identification of graphs , 1976 .