Hamilton cycle of graph sigma2 >= n
Author affiliations
DOI:
https://doi.org/10.15625/1813-9663/28/2/2496Abstract
Given a undirected and simple graph with n vertices, we denote by sigma_2 the minimum of degree sum of the pair of nonadjacent vertices in G and by sigma_2^* the minimum of degree sum of the pair of nonadjacent vertices with distance 2.
The problem HC to determine the Hamilton cycle (cycle passing all the vertices of the graph) is well-known a NPC problem. We consider the problem HC for the class of graphs satisfying sigma_2 >n and for the class of graphs satisfying sigma_2^* >n, with given constant t. In this paper we give polynomial algorithm to estimate Hamilton cycle for the case t> 1 and prove that the problem HC remains a NPC problem for the case t<1.
Metrics
Metrics Loading ...
Downloads
How to Cite
[1]
V. Đình Hòa and N. H. X. Trường, “Hamilton cycle of graph sigma2 >= n”, JCC, vol. 28, no. 2, pp. 153–160, Oct. 2012.
Issue
Section
Computer Science
License
1. We hereby assign copyright of our article (the Work) in all forms of media, whether now known or hereafter developed, to the Journal of Computer Science and Cybernetics. We understand that the Journal of Computer Science and Cybernetics will act on my/our behalf to publish, reproduce, distribute and transmit the Work.2. This assignment of copyright to the Journal of Computer Science and Cybernetics is done so on the understanding that permission from the Journal of Computer Science and Cybernetics is not required for me/us to reproduce, republish or distribute copies of the Work in whole or in part. We will ensure that all such copies carry a notice of copyright ownership and reference to the original journal publication.
3. We warrant that the Work is our results and has not been published before in its current or a substantially similar form and is not under consideration for another publication, does not contain any unlawful statements and does not infringe any existing copyright.
4. We also warrant that We have obtained the necessary permission from the copyright holder/s to reproduce in the article any materials including tables, diagrams or photographs not owned by me/us.
