SavedAdd your journal

Journals / Fundamental Journal of Mathematics and Applications / 2018 / Cilt: 1 - Sayı: 2

Minimum Degree and Size Conditions for Hamiltonian and Traceable Graphs

Rao Lİ, Anuj DAGA, Vivek GUPTA, Manad MİSHRA, Spandan Kumar SAHU, Ayush SİNHA

Pages
191–193
DOI
—

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].