Geodesic
Recognizing circulant graphs in polynomial time: An application of association schemes
The electronic journal of combinatorics, Tome 8 (2001) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/1570
Classification : 05C25, 05C85
Mots-clés : automorphism, polynomial recognition algorithm, circulant graphs, Schur rings 
@article{10_37236_1570,
     author = {Mikhail E. Muzychuk and Gottfried Tinhofer},
     title = {Recognizing circulant graphs in polynomial time: {An} application of association schemes},
     journal = {The electronic journal of combinatorics},
     year = {2001},
     volume = {8},
     number = {1},
     doi = {10.37236/1570},
     zbl = {0996.05072},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1570/}
}
TY  - JOUR
AU  - Mikhail E. Muzychuk
AU  - Gottfried Tinhofer
TI  - Recognizing circulant graphs in polynomial time: An application of association schemes
JO  - The electronic journal of combinatorics
PY  - 2001
VL  - 8
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1570/
DO  - 10.37236/1570
ID  - 10_37236_1570
ER  - 
%0 Journal Article
%A Mikhail E. Muzychuk
%A Gottfried Tinhofer
%T Recognizing circulant graphs in polynomial time: An application of association schemes
%J The electronic journal of combinatorics
%D 2001
%V 8
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1570/
%R 10.37236/1570
%F 10_37236_1570
Mikhail E. Muzychuk; Gottfried Tinhofer. Recognizing circulant graphs in polynomial time: An application of association schemes. The electronic journal of combinatorics, Tome 8 (2001) no. 1. doi: 10.37236/1570

Cité par Sources :