Abstract
The Hamiltonian path is a famous algorithm for determining the existence or nonexistence of a graph. However, for certain types of graphs, we can apply certain conditions to determine its existence. In this paper, we discuss the results show that there can be at most (n-1)/2 edges disjoint Hamiltonian paths in a complete graph. Also, discussed examples of its applications in different fields. Furthermore, the application of Hamilton path in the DNA sequence has been investigated.
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 callDisclaimer: 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.
