Abstract

Two necessary and sufficient conditions are presented for Hamiltonian cycle problem in simple undirected graph using linear Diophantine equation systems with cycle vector. The first one is based on the incidence matrix and the second one is based on edge-adjacency matrix. It is proven that the solution set of the cycle vector correspond to the edges of Hamiltonian cycle in a given graph. Based on these result conditions, two necessary conditions for the Hamiltonian graph are given by determining the rank of the matrix.

Full Text
Paper version not known

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.