Automorphism groups of circulant graphs -- a survey
classification
🧮 math.CO
math.GR
keywords
automorphismcirculantgraphbeencyclicgraphsgroupssurvey
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.