Voir la notice de l'article provenant de la source Math-Net.Ru
@article{MZM_1999_65_3_a8, author = {V. E. Tarakanov}, title = {Automorphism groups of circulants, and adjacency matrices of graphs}, journal = {Matemati\v{c}eskie zametki}, pages = {402--411}, publisher = {mathdoc}, volume = {65}, number = {3}, year = {1999}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/MZM_1999_65_3_a8/} }
V. E. Tarakanov. Automorphism groups of circulants, and adjacency matrices of graphs. Matematičeskie zametki, Tome 65 (1999) no. 3, pp. 402-411. http://geodesic.mathdoc.fr/item/MZM_1999_65_3_a8/
[1] Elspas B., Turner J., “Graphs with circulant adjacency matrices”, J. Combin. Theory, 9 (1970), 297–307 | DOI | MR | Zbl
[2] Alspach B., Parsons T., “Isomorphisms of circulant graphs and digraphs”, Discrete Math., 25 (1979), 97–108 | DOI | MR | Zbl
[3] Boesch F., Tindell R., “Circulants and their connectivities”, J. Graph Theory, 8 (1984), 487–499 | DOI | MR | Zbl
[4] Huang Q., Meng J., “On the isomorphisms and automorphism groups of circulants”, Graphs Combin., 12 (1996), 179–187 | DOI | MR | Zbl
[5] Huang Q., Yuan J., “The automorphism groups of circulants of degree $3$”, Ars Combin., 44 (1996), 263–271 | MR | Zbl
[6] Biggs N. Z., Algebraic Graph Theory, Cambridge Univ. Press, Cambridge, 1974 | Zbl
[7] Adam A., “Research problem 2–10”, J. Combin. Theory, 2 (1967), 393 | DOI
[8] Tarakanov V. E., “K zadache klassifikatsii $(0,1)$-matrits”, Voprosy kibernetiki. Kombinatornyi analiz i teoriya grafov, AN SSSR, M., 1980, 67–80
[9] Cameron P. J., Automorphism groups, Sel. Topics Graph Theory, 11, Acad. Press, London, 1983
[10] Tarakanov V. E., “Kombinatornye zadachi na binarnykh matritsakh”, Kombinatornyi analiz, 5, ed. K. A. Rybnikov, MGU, M., 1980, 4–15 | MR
[11] Tarakanov V. E., “Tsiklicheskie binarnye matritsy i ikh gruppy perestanovochnykh avtomorfizmov”, Matem. zametki, 55:4 (1994), 83–95 | MR | Zbl