http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
MINIMUM DEGREE AND INDEPENDENCE NUMBER FOR THE EXISTENCE OF HAMILTONIAN [a, b]-FACTORS
Zhou, Sizhong,Pu, Bingyuan The Korean Society for Computational and Applied M 2010 Journal of applied mathematics & informatics Vol.28 No.1
Let a and b be nonnegative integers with 2 $\leq$ a < b, and let G be a Hamiltonian graph of order n with n > $\frac{(a+b-5)(a+b-3)}{b-2}$. An [a, b]-factor F of G is called a Hamiltonian [a, b]-factor if F contains a Hamiltonian cycle. In this paper, it is proved that G has a Hamiltonian [a, b]-factor if $\delta(G)\;\geq\;\frac{(a-1)n+a+b-3)}{a+b-3}$ and $\delta(G)$ > $\frac{(a-2)n+2{\alpha}(G)-1)}{a+b-4}$.
MINIMUM DEGREE AND INDEPENDENCE NUMBER FOR THE EXISTENCE OF HAMILTONIAN [a, b]-FACTORS
Sizhong Zhou,Bingyuan Pu 한국전산응용수학회 2010 Journal of applied mathematics & informatics Vol.28 No.1
Let a and b be nonnegative integers with 2 ≤ a < b, and let, G be a Hamiltonian graph of order n with n >[수식]. An [a, b]-factor F of G is called a Hamiltonian [a, b]-factor if F contains a Hamiltonian cycle. In this paper, it is proved that G has a Hamiltonian [a, b]-factor if δ(G) ≥[수식] and δ(G) >[수식].