Hamiltonian cycles in vertex symmetric graphs of order 2 P2

Dragan Marušič

Open Access

https://doi.org/10.1016/0012-365x(87)90129-4

Copy DOI

Journal: Discrete Mathematics	Publication Date: Aug 1, 1987
Citations: 20	License type: elsevier-specific: oa user license

Abstract

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

Full Text

Paper version not known

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Paper Title

Journal

Date

Author