Cubic graphs with most automorphisms

Simple item page
dc.creatorvan Opstall, Michael A.
dc.creatorVeliche, Razvan
dc.date2006-08-25
dc.date.accessioned2026-07-07T07:22:11Z
dc.date.available2026-07-07T07:22:11Z
dc.descriptionWe give a sharp bound for the automorphism group of a cubic simple graph with a given number of vertices. For each number of vertices we give an explicit graph attaining the bound, and prove its uniqueness in special cases.
dc.description24 pages
dc.identifierhttps://arxiv.org/abs/math/0608645
dc.identifierhttp://arxiv.org/abs/math/0608645
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/115566
dc.subjectCombinatorics
dc.subject05C
dc.titleCubic graphs with most automorphisms
dc.typetext

Files

Collections

arXiv