## Abstract In this paper, we show that __n__ β©Ύ 4 and if __G__ is a 2βconnected graph with 2__n__ or 2__n__β1 vertices which is regular of degree __n__β2, then __G__ is Hamiltonian if and only if __G__ is not the Petersen graph.
On a special class of hamiltonian graphs
β Scribed by Gary Chartrand; Hudson V. Kronk
- Book ID
- 112782677
- Publisher
- European Mathematical Society
- Year
- 1969
- Tongue
- English
- Weight
- 260 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0010-2571
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Using the concept of brick-products, Alspach and Zhang showed in that all cubic Cayley graphs over dihedral groups are Hamiltonian. It is also conjectured that all brick-products C(2n, m, r) are Hamiltonian laceable, in the sense that any two vertices at odd distance apart can be joined by a Hamilt
A digraph with n vertices and fixed outdegree m is generated randomly so that each such digraph is equally likely to be chosen. We consider the probability of the existence of a Hamiltonian cycle in the graph obtained by ignoring arc orientation. We show that there exists m (~23) such that a Hamilto