Title
On the automorphism groups of almost all circulant graphs and digraphs
Abstract
We attempt to determine the structure of the automorphism group of a generic circulant graph. We first show that almost all circulant graphs have automorphism groups as small as possible. The second author has conjectured that almost all of the remaining circulant (di)graphs (those whose automorphism group is not as small as possible) are normal circulant (di)graphs. We show this conjecture is not true in general, but is true if we consider only those circulant (di)graphs whose order is in a "large" subset of integers. We note that all non-normal circulant (di)graphs can be classified into two natural classes (generalized wreath products, and deleted wreath type), and show that neither of these classes contains almost every non-normal circulant digraph.
Year
DOI
Venue
2014
10.26493/1855-3974.315.868
ARS MATHEMATICA CONTEMPORANEA
Keywords
Field
DocType
Circulant graph,automorphism group,Cayley graph,DRR,GRR
Graph automorphism,Integer,Discrete mathematics,Combinatorics,Circulant graph,Automorphism,Cayley graph,Circulant matrix,Conjecture,Mathematics,Digraph
Journal
Volume
Issue
ISSN
7
2
1855-3966
Citations 
PageRank 
References 
2
0.41
4
Authors
3
Name
Order
Citations
PageRank
soumya bhoumik120.41
ted dobson220.75
Joy Morris37816.06