Abstract
Abstract An important concept, “closed domain” is proposed in this paper. In the same time, necessary and sufficient lemma for closed domain, R, is proved on which necessary and sufficient theorem for judging whether a general graph G is a Hamilton graph is proposed and proved. All instances in this paper are judged by comparatively using the theorem proposed herein and the original necessary condition theorem and sufficient condition theorem to prove the correctness of the method proposed in this paper.
Sign-in/Register to access full text options 
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.
