Math & Computer Science

Permanent URI for this community

Now showing 1 - 1 of 1

On the automorphism groups of almost all circulant graphs and digraphs
(Drustvo Matematikov, Fizikov in Astronomov, 2018) Bhoumik, Soumya; Dobson, Edward; Morris, Joy
We attempt to determine the structure of the automorphism group of a generic circulant graph. We ﬁrst 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 classiﬁed 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.