Minimum Degree and Size Conditions for Hamiltonian and Traceable Graphs

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Fundamental Journal of Mathematics and Applications
Volume:1 Issue:2
Minimum Degree and Size Conditions for Hamiltonian and Traceable Graphs

Minimum Degree and Size Conditions for Hamiltonian and Traceable Graphs

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

Pages : 191-193

Doi:10.33401/fujma.450809

View : 14 | Download : 12

Publication Date : 2018-12-25

Article Type : Research Paper

Abstract :A graph is called Hamiltonian insert ignore into journalissuearticles values(resp. traceable); if the graph has a Hamiltonian cycle insert ignore into journalissuearticles values(resp. path);, a cycle insert ignore into journalissuearticles values(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

ORIGINAL ARTICLE URL

VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.