Automorphism groups of circulant graphs -- a survey
Combinatorics
2007-05-23 v1 Group Theory
Abstract
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.
Cite
@article{arxiv.math/0411302,
title = {Automorphism groups of circulant graphs -- a survey},
author = {Joy Morris},
journal= {arXiv preprint arXiv:math/0411302},
year = {2007}
}
Comments
16 pages, 0 figures, LaTeX file