Journal of applied mathematics & informatics

한국전산응용수학회 (The Korean Society for Computational and Applied Mathematics)
권호 표지

MINIMUM DEGREE AND INDEPENDENCE NUMBER FOR THE EXISTENCE OF HAMILTONIAN [a, b]-FACTORS

  • Zhou, Sizhong (School of Mathematics and Physics, Jiangsu University of Science and Technology) ;
  • Pu, Bingyuan (Department of Fundamental Course, Cheng여 Textile College)
  • 발행 : 2010.01.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

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}$.

키워드

참고문헌

  1. A. Bondy and U. S. R. Murty, Graph Theory with Applications, The Macmillan Press, London, 1976.
  2. J. R. Correa and M. Matamala, Some remarks about factors of graphs, Journal of Graph Theory 57(2008), 265-274. https://doi.org/10.1002/jgt.20284
  3. H, Matsuda, Fan-type results for the existence of $\left[a, b \right]$ -factors, Discrete Mathematics 306 (2006), 688-693. https://doi.org/10.1016/j.disc.2006.01.018
  4. S. Zhou and H. Liu, Neighborhood conditions and fractional k-factors, Bulletin of the Malaysian Mathematical Sciences Society 32(1)(2009), 37-45.
  5. S. Zhou, Independence number,connectivity and (a, b, k)-crtical graphs, Discrete Mathematics 309(12)(2009), 4144-4148. https://doi.org/10.1016/j.disc.2008.12.013
  6. S. Zhou, A sufficient condition for a graph to be an (a ,b, k)-critical graph, International Journal of Computer Mathematics, to appear.
  7. S. Zhou and J. Jiang, Notes On the binding numbers for (a , b, k)-critical graphs, Bulletin of the Australian Mathematical Society 76(2)(2007), 307-314. https://doi.org/10.1017/S000497270003968X
  8. S. Zhou and Y. Xu, Neighborhoods of independent sets for (a, b, k)-critical graphs, Bulletin of the Australian Mathematical Society 77(2)(2008), 277-283.
  9. Y. Gao, G. Li and X. Li, Degree condition for the existence of a k-factor containing a given Hamiltonian cycle, Discrete Mathematics 309(2009), 2373-2381. https://doi.org/10.1016/j.disc.2008.05.014
  10. H. Matsuda, Degree conditions for Hamiltonian graphs to have $\left[a, b \right]$-factors containing a given Hamiltonian cycle, Discrete Mathematics 280(2004), 241-250. https://doi.org/10.1016/j.disc.2003.10.015
  11. S. Zhou and B. Pu, Hamiltonian factors in Hamiltonian graphs, International Journal of Computational and Mathematical Sciences 3(2)(2009), 83-85.
  12. G. Liu and L. Zhang, Factors and factorizations of graphs (in Chinese), Advances in Mathematics 29(2000), 289-296.
  13. L. Lovasz, Subgraphs with prescribed valencies, Journal of Combinatorial Theory 8(1970), 391-416. https://doi.org/10.1016/S0021-9800(70)80033-3