RECOGNIZING THE HAMILTONIAN GRAPH WITH IS AN EASY PROBLEM
Main Article Content
Abstract
Let  be an undirected and single graph on  vertices with , i.e., the degree sum of any two non-adjacent vertices in  is equal to . We show that, recognizing the whether or not  is a Hamiltonian graph can be done in polynomial time.
ÂDownloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.
References
Bondy J. A. and Chvátal V., A Method in Graph Theory, Discrete Math. 15, p. 111-135, 1976.
Graham R., Lovász L. and Grotschel M., Handbook of combinatorics, Vol 1, Elsevier Science B.V., 1995.
An D. Nhu, Duong B. Duc, “Some problems about Hamiltonian Cycle in special graphsâ€, The 2nd International Conference on Theories and Applications of Computer Science (ICTACS’09), Journal of Sciencce and Technology, Vietnam Academy of Science and Technology, Vol. 46, No 5A (2008), 57-66.
An D. Nhu, Hoa V. Dinh, “Necessary and sufficient condition for Maximil uniquely Hamiltonian graphâ€. International Journal of Advanced Research in Computer Science (IJARCS). Volume 3 No. 5 September-October 2012.