arXiv Analytics

Sign in

arXiv:math/0411302 [math.CO]AbstractReferencesReviewsResources

Automorphism groups of circulant graphs -- a survey

Joy Morris

Published 2004-11-13Version 1

A circulant (di)graph is a (di)graph on n vertices that admits a cyclic automorphism of order n. This paper provides a survey of the work that has been done on finding the automorphism groups of circulant (di)graphs, including the generalisation in which the edges of the (di)graph have been assigned colours that are invariant under the aforementioned cyclic automorphism.

Comments: 16 pages, 0 figures, LaTeX file
Categories: math.CO, math.GR
Subjects: 05C25
Related articles: Most relevant | Search more
arXiv:1203.0707 [math.CO] (Published 2012-03-04)
Asymptotic Automorphism Groups of Circulant Graphs and Digraphs
arXiv:1403.7933 [math.CO] (Published 2014-03-31)
Additive codes over $GF(4)$ from circulant graphs
arXiv:0909.2314 [math.CO] (Published 2009-09-12)
A new counting methods, including the issue of counting labelled self-complementary graphs

Links

Toolbox