7-days of FREE Audio papers, translation & more with Prime
7-days of FREE Prime access
7-days of FREE Audio papers, translation & more with Prime
7-days of FREE Prime access
https://doi.org/10.1007/s13370-017-0503-y
Copy DOIJournal: Afrika Matematika | Publication Date: May 9, 2017 |
Citations: 6 |
Let G be a simple 2-connected, $$C_4$$ -free graph with minimum degree $$\delta (G)\ge 4$$ and leaf number L(G) such that $$\delta (G)\ge \displaystyle \frac{1}{2}L(G)$$ . We show that G is Hamiltonian. In addition, we provide family of graphs to show that the results are best possible for aforementioned class of graphs. The results, apart from supporting the conjecture (Graffiti.pc 190) of the computer program Graffiti.pc, instructed by DeLaVi $${\tilde{n}}$$ a, provide a new sufficient condition for Hamiltonicity in $$C_4$$ -free graphs.
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.