Abstract

The Clique Number and Some Hamiltonian Properties of Graphs

Highlights

  • A cycle C in a graph G is called a Hamiltonian cycle of G if C contains all the vertices of G

  • A path P in a graph G is called a Hamiltonian path of G if P contains all the vertices of G

  • A graph G is called traceable if G has a Hamiltonian path

Read more

Summary

Introduction

A graph is said to be Hamiltonian (respectively, traceable) if it has a Hamiltonian cycle (respectively, Hamiltonian path), where a Hamiltonian cycle (respectively, Hamiltonian path) is a cycle (respectively, path) containing all the vertices of the graph. A cycle C in a graph G is called a Hamiltonian cycle of G if C contains all the vertices of G. A path P in a graph G is called a Hamiltonian path of G if P contains all the vertices of G.

Results
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.