34
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Binding number and Hamiltonian (g, f)-factors in graphs II

, &
Pages 1325-1331 | Received 27 Jun 2006, Accepted 07 Jun 2007, Published online: 20 Aug 2008
 

Abstract

A (g, f)-factor F of a graph G is called a Hamiltonian (g, f)-factor if F contains a Hamiltonian cycle. For a subset X of V(G), let N G (X)= gcup xX N G (x). The binding number of G is defined by bind(G)=min{| N G (X) |/| X|| ∅≠XV(G), N G (X)≠V(G)}. Let G be a connected graph of order n, 3≤ab be integers, and b≥4. Let g, f be positive integer-valued functions defined on V(G), such that ag(x)≤f(x)≤b for every xV(G). Suppose n≥(a+b−4)2/(a−2) and f(V(G)) is even, we shall prove that if bind(G)>((a+b−4)(n−1))/((a−2)n−(5/2)(a+b−4)) and for any independent set XV(G), N G (X)≥((b−3)n+(2a+2b−9)| X|)/(a+b−5), then G has a Hamiltonian (g, f)-factor.

2000 AMS Subject Classification :

Acknowledgements

This work was supported by the National Natural Science Foundation(10471078) and the Doctoral Program Foundation of Education Ministry (20040422004) of China.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.