𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamiltonian cycles in vertex symmetric graphs of order 2P2

✍ Scribed by Dragan Marušič

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
365 KB
Volume
66
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that every connected vertex symmetric graph of order 2p 2, where p is a prime, is Hamiltonian.

📜 SIMILAR VOLUMES

Hamiltonian paths in vertex-symmetric gr
Hamiltonian paths in vertex-symmetric graphs of order 4p
✍ Dragan Marušič; T.D. Parsons 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 562 KB

It is shown that every connected vertex-symmetric graph of order 4p (p a prime) has a Hamiltonian path. ## 1. Il#aoductjon L. Lovasz has conjectured that every connected vertex-symmetric graph (cvsg) has a Hamiltonian path. This conjecture has been verified for graphs of order p, 2p, 3p, p2, and p

Hamiltonian cycles in 2-connected claw-f
Hamiltonian cycles in 2-connected claw-free-graphs
✍ Hao Li 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB 👁 2 views

## Abstract M. Matthews and D. Sumner have proved that of __G__ is a 2‐connected claw‐free graph of order __n__ such that δ ≧ (__n__ − 2)/3, then __G__ is hamiltonian. We prove that the bound for the minimum degree δ can be reduced to __n__/4 under the additional condition that __G__ is not in __F_

Disjoint Hamiltonian cycles in fan 2k-ty
Disjoint Hamiltonian cycles in fan 2k-type graphs
✍ Zhou Sanming 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB

## Abstract It is conjectured that a 2(__k__ + 1)‐connected graph of order __p__ contains __k__ + 1 pairwise disjoint Hamiltonian cycles if no two of its vertices that have degree less than 1/2 + 2__k__ are distance two apart. This is proved in detail for __k__ = 1. Similar arguments establish the

Cubic vertex-transitive graphs of order
Cubic vertex-transitive graphs of order 2pq
✍ Jin-Xin Zhou; Yan-Quan Feng 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB

A graph is vertex-transitive or symmetric if its automorphism group acts transitively on vertices or ordered adjacent pairs of vertices of the graph, respectively. Let G be a finite group and S a subset of G such that 1 / ∈ S and S = {s -1 | s ∈ S}. The Cayley graph Cay(G, S) on G with respect to S

Hamiltonian cycles and paths in vertex-t
Hamiltonian cycles and paths in vertex-transitive graphs with abelian and nilpotent groups
✍ Marc J. Lipman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 378 KB

In 1968, L. Lovfisz conjectured that every connected, vertex-transitive graph had a Hamiltonian path. In this paper the following results are proved: (1) If a connected graph has a transitive nilpotent group acting on it, then the graph has a Hamiltonian path; (2) a connected, vertex-transitive grap