Minimum Degree and Size Conditions for Hamiltonian and Traceable Graphs

Authors : Rao Li, Anuj Daga, Vivek Gupta, Manad Mishra, Spandan Kumar Sahu, Ayush Sinha

Pages : 191-193

Doi:10.33401/fujma.450809

View : 12 | Download : 9

Publication Date : 2018-12-25

Article Type : Research

Abstract :A graph is called Hamiltonian (resp. traceable) if the graph has a Hamiltonian cycle (resp. path), a cycle (resp. path) containing all the vertices of the graph. In this note, we present sufficient conditions involving minimum degree and size for Hamiltonian and traceable graphs. One of the sufficient conditions strengthens the result obtained by Nikoghosyan in [1].
Keywords : Hamiltonian graph, Minimum degree, Traceable graph