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...

Ful tanımlama

Kaydedildi:
Detaylı Bibliyografya
Yazar: Daugulis, Peteris; Institute of Life Sciences and Technologies Daugavpils University, Parades 1, Daugavpils, Latvia (Yazar)
Materyal Türü: EJournal Article
Baskı/Yayın Bilgisi: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2020-10-15.
Konular:
Online Erişim:Get Fulltext
Etiketler: Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
Diğer Bilgiler
Özet: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. 
Diğer Bilgileri:https://www.ejgta.org/index.php/ejgta/article/view/783