Some infinite classes of asymmetric nearly Hamiltonian snarks
We determine the full automorphism group of each member of three infinite families of connected cubic graphs which are snarks. A graph is said to be nearly hamiltonian if it has a cycle which contains all vertices but one. We prove, in particular, that for every possible order n ≥ 28 there exists a...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Università degli Studi di Catania
2010-12-01
|
| Series: | Le Matematiche |
| Subjects: | |
| Online Access: | http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/798 |
| Summary: | We determine the full automorphism group of each member of three infinite families of connected cubic graphs which are snarks. A graph is said to be nearly hamiltonian if it has a cycle which contains all vertices but one. We prove, in particular, that for every possible order n ≥ 28 there exists a nearly hamiltonian snark of order n with trivial automorphism group.<br /> |
|---|---|
| ISSN: | 0373-3505 2037-5298 |