Abstract
We prove that every connected vertex symmetric graph of order 2 p 2, where p is a prime, is Hamiltonian.
Full Text
Sign-in/Register to access full text options
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have