We determine the full automorphism group of each member of threeinfinite families of connected cubic graphs which are snarks. A graph issaid to be nearly hamiltonian if it has a cycle which contains all verticesbut one. We prove, in particular, that for every possible order n > 28 thereexists a nearly hamiltonian snark of order n with trivial automorphismgroup.
SOME INFINITE CLASSES OF ASYMMETRICNEARLY HAMILTONIAN SNARKS / Fiori, Carla; Ruini, Beatrice. - In: LE MATEMATICHE. - ISSN 0373-3505. - STAMPA. - 65:(2010), pp. 3-21.
SOME INFINITE CLASSES OF ASYMMETRICNEARLY HAMILTONIAN SNARKS
FIORI, Carla;RUINI, Beatrice
2010
Abstract
We determine the full automorphism group of each member of threeinfinite families of connected cubic graphs which are snarks. A graph issaid to be nearly hamiltonian if it has a cycle which contains all verticesbut one. We prove, in particular, that for every possible order n > 28 thereexists a nearly hamiltonian snark of order n with trivial automorphismgroup.
| File | Dimensione | Formato | |
|---|---|---|---|
|
rigid_snarks.pdf
Open access
Tipologia:
AO - Versione originale dell'autore proposta per la pubblicazione
Dimensione
621.23 kB
Formato
Adobe PDF
|
621.23 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
