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...
Saved in:
| Main Author: | |
|---|---|
| Format: | EJournal Article |
| Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2020-10-15.
|
| Subjects: | |
| Online Access: | Get Fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 01660 am a22002533u 4500 | ||
|---|---|---|---|
| 001 | EJGTA_783_pdf_136 | ||
| 042 | |a dc | ||
| 100 | 1 | 0 | |a Daugulis, Peteris; Institute of Life Sciences and Technologies Daugavpils University, Parades 1, Daugavpils, Latvia |e author |
| 100 | 1 | 0 | |e contributor |
| 245 | 0 | 0 | |a 16-vertex graphs with automorphism groups A4 and A5 from the icosahedron |
| 260 | |b GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, |c 2020-10-15. | ||
| 500 | |a https://www.ejgta.org/index.php/ejgta/article/view/783 | ||
| 520 | |a 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. | ||
| 540 | |a Copyright (c) 2020 Electronic Journal of Graph Theory and Applications (EJGTA) | ||
| 546 | |a eng | ||
| 690 | |a graph, icosahedron, hemi-icosahedron, automorphism group, alternating group | ||
| 690 | |a 05C25, 05E18, 05C35 | ||
| 655 | 7 | |a info:eu-repo/semantics/article |2 local | |
| 655 | 7 | |a info:eu-repo/semantics/publishedVersion |2 local | |
| 655 | 7 | |a Peer-reviewed Article |2 local | |
| 786 | 0 | |n Electronic Journal of Graph Theory and Applications (EJGTA); Vol 8, No 2 (2020): Electronic Journal of Graph Theory and Applications; 211 - 216 | |
| 786 | 0 | |n 2338-2287 | |
| 787 | 0 | |n https://www.ejgta.org/index.php/ejgta/article/view/783/pdf_136 | |
| 856 | 4 | 1 | |u https://www.ejgta.org/index.php/ejgta/article/view/783/pdf_136 |z Get Fulltext |