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.
CITATION STYLE
Morris, J. (2006). Automorphism Groups of Circulant Graphs — a Survey. In Graph Theory in Paris (pp. 311–325). Birkhäuser Basel. https://doi.org/10.1007/978-3-7643-7400-6_24
Mendeley helps you to discover research relevant for your work.