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

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

Полное описание

Сохранить в:
Библиографические подробности
Главный автор: Daugulis, Peteris; Institute of Life Sciences and Technologies Daugavpils University, Parades 1, Daugavpils, Latvia (Автор)
Формат: EJournal Article
Опубликовано: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2020-10-15.
Предметы:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Online-ссылка:Get Fulltext
Метки: Добавить метку
Нет меток, Требуется 1-ая метка записи!
Описание
Итог: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. 
Примечание:https://www.ejgta.org/index.php/ejgta/article/view/783

Схожие документы