Smallest graphs with given automorphism group
Group Theory
2022-03-25 v3 Combinatorics
Abstract
For a finite group , denote by the minimum number of vertices of any graph having . In this paper, we prove that , with specified exceptions. The exceptions include four infinite families of groups, and 17 other small groups. Additionally, we compute for the groups such that where the value was previously unknown.
Cite
@article{arxiv.2108.10384,
title = {Smallest graphs with given automorphism group},
author = {Danai Deligeorgaki},
journal= {arXiv preprint arXiv:2108.10384},
year = {2022}
}
Comments
27 pages, 1 figure