16-vertex graphs with automorphism groups A4 and A5 from the icosahedron

The article deals with the problem of finding vertex-minimal graphs with a given automorphism group. We exhibit two undirected 16-vertex graphs having automorphism groups A4 and A5. It improves Babai's bound for A4 and the graphical regular representation bound for A5. The graphs are constructe...

Täydet tiedot

Tallennettuna:
Bibliografiset tiedot
Päätekijä: Daugulis, Peteris; Institute of Life Sciences and Technologies Daugavpils University, Parades 1, Daugavpils, Latvia (Tekijä)
Aineistotyyppi: EJournal Article
Julkaistu: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2020-10-15.
Aiheet:
Linkit:Get Fulltext
Tagit: Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!
Kuvaus
Yhteenveto:The article deals with the problem of finding vertex-minimal graphs with a given automorphism group. We exhibit two undirected 16-vertex graphs having automorphism groups A4 and A5. It improves Babai's bound for A4 and the graphical regular representation bound for A5. The graphs are constructed using projectivisation of the vertex-face graph of the icosahedron. 
Huomautukset:https://www.ejgta.org/index.php/ejgta/article/view/783