On automorphism groups of circulant digraphs of square-free order

Discrete Mathematics

Volumn 299, Issue 1-3, 2005, Pages 79-98

  Dobson, Edward ^a   Morris, Joy ^b  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

^b UNIVERSITY OF LETHBRIDGE   (Canada)

Author keywords

Automorphism group; Automorphisms; Cayley graphs; Circulant graphs; Directed graphs; Graphs

Indexed keywords

MATHEMATICAL TECHNIQUES; NUMERICAL ANALYSIS;

AUTOMORPHISMS; CAYLEY GRAPHS; CIRCULANT DIGRAPHS; CIRCULANT GRAPHS;

GRAPH THEORY;

EID: 24344480518     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2004.03.018     Document Type: Article

References (25)

1. B. Alspach Point-symmetric graphs and digraphs of prime order and transitive permutation groups of prime degree J. Combin. Theory 15 1973 12 17
2. B. Alspach, M. Conder, and D. Marušič A classification of 2-arc transitive circulants J. Algebraic. Combin. 5 1996 83 86
3. J.L. Berggren An algebraic characterization of symmetric graphs with p points, p an odd prime Bull. Austral. Math. Soc. 7 1972 131 134
4. B. Bollobás Graph Theory 1979 Springer New York
5. P.J. Cameron Finite Permutation groups and finite simple groups Bull. London Math. Soc. 13 1981 1 22
6. J.H. Conway, R.T. Curtis, S.P. Norton, R.A. Parker, and R.A. Wilson Atlas of Finite Groups 1985 Oxford University Press New York
7. J.H. Conway, R.T. Curtis, S.P. Norton, R.A. Parker, R.A. Wilson, Atlas of Finite Groups, web version, http://web.mat.bham.ac.uk/atlas/html/L211.html.
8. J.D. Dixon, B. Mortimer, Permutation Groups, Graduate Texts in Mathematics, vol. 163, Springer, New York, Berlin, Heidelberg, 1996.
9. E. Dobson Isomorphism problem for Cayley graphs of Z p 3 Discrete Math. 147 1995 87 94
10. E. Dobson, J. Morris, A polynomial time algorithm to compute the full automorphism group of a circulant graph of square-free order, in preparation.
11. E. Dobson, and D. Witte Transitive permutation groups of prime-squared degree J. Algebraic Combin. 16 2002 43 69
12. B. Elspas, and J. Turner Graphs with circulant adjacency matrices J. Combin. Theory Ser. B 9 1970 297 307
13. R. Frucht Herstellung von Graphen mit vorgegebener abstrakter Gruppe Composito Math. 6 1938 239 250
14. D. Gorenstein Finite Groups 1968 Chelsea New York
15. B. Huppert Endliche Gruppen I 1967 Springer Berlin
16. L.A. Kalužnin, and M.H. Klin On some numerical invariants of permutation groups Latv. Math. Ežegodnik 18 1976 81 99 (in Russian)
17. M.H. Klin, R. Pöschel, The König problem, the isomorphism problem for cyclic graphs and the method of Schur, Proceedings of the Inter. Coll. on Algebraic methods in graph theory, Szeged 1978, Coll. Mat. Soc. János Bolyai 27.
18. M.Ch. Klin, R. Pöschel, The isomorphism problem for circulant graphs with p n vertices, Preprint P-34/80 ZIMM, Berlin 1980.
19. K.H. Leung, and S.L. Ma The structure of Schur rings over cyclic groups J. Pure Appl. Algebra 66 1990 287 302
20. M. Muzychuk Ádám's conjecture is true in the square-free case J. Combin. Theory Ser. A 72 1995 118 134
21. M. Muzychuk The structure of Schur rings over cyclic groups of square-free order Acta Appl. Math. 52 1998 163 181
22. M. Muzychuk, and G. Tinhofer Recognizing circulant graphs of prime order in polynomial time El. J. of Comb. 5 1998 #R25
23. G. Sabidussi The composition of graphs Duke Math. J. 26 1959 693 696
24. W.R. Scott Group Theory 1987 Dover Press New York
25. H. Wielandt Finite Permutation Groups 1964 Academic Press New York