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.

Rights

URN

URN:NBN:SI:DOC-EOQHLR3S

COBISSID

17165145

Added

29.05.2020

Metadata

Citation

APA:

Bhoumik, Soumya, Dobson, Edward, Morris, Joy (2014). On the automorphism groups of almost all circulant graphs and digraphs. Ars mathematica contemporanea, volume 7, issue 2, str. 499-518. URN:NBN:SI:DOC-EOQHLR3S from http://www.dlib.si

MLA:

Bhoumik, Soumya, Dobson, Edward, Morris, Joy. "On the automorphism groups of almost all circulant graphs and digraphs." Ars mathematica contemporanea volume 7. issue 2 (2014) str. 499-518.
<http://www.dlib.si/?URN=URN:NBN:SI:DOC-EOQHLR3S>

Ars mathematica contemporanea
2008-
(Assembly record)