Journal of applied mathematics & informatics

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

NOTE ON CONNECTED (g, f)-FACTORS OF GRAPHS

  • Zhou, Sizhong (School of Mathematics and Physics, Jiangsu University of Science and Technology) ;
  • Wu, Jiancheng (School of Mathematics and Physics, Jiangsu University of Science and Technology) ;
  • Pan, Quanru (School of Mathematics and Physics, Jiangsu University of Science and Technology)
  • 투고 : 2009.09.22
  • 심사 : 2010.02.16
  • 발행 : 2010.05.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this note we present a short proof of the following result by Zhou, Liu and Xu. Let G be a graph of order n, and let a and b be two integers with 1 $\leq$ a < b and b $\geq$ 3, and let g and f be two integer-valued functions defined on V(G) such that a $\leq$ g(x) < f(x) $\leq$ b for each $x\;{\in}\;V(G)$ and f(V(G)) - V(G) even. If $n\;{\geq}\;\frac{(a+b-1)^2+1}{a}$ and $\delta(G)\;{\geq}\;\frac{(b-1)n}{a+b-1}$,then G has a connected (g, f)-factor.

키워드

참고문헌

  1. 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
  2. S. Zhou, Independence number, Connectivity and (a, b, k)-critical graphs, Discrete Mathematics 309(12)(2009), 4144-4148. https://doi.org/10.1016/j.disc.2008.12.013
  3. 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
  4. 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.
  5. S. Zhou and X. Xue, (g, f)-Factors of graphs with prescribed properties, Journal of Systems Science and Mathematical Sciences 28(2) (2008), 193-196.
  6. H. Matsuda, On 2-edge-connected [a, b]-factors of graphs with Ore-type condition, Discrete Mathematics 296(2005), 225-234. https://doi.org/10.1016/j.disc.2005.01.004
  7. M. Kouider and P. D. Vestergaard, Connected factors in graphs - a survey, Graphs and Combinatorics 21(2005), 1-26. https://doi.org/10.1007/s00373-004-0587-7
  8. G. Li, Y. Xu, C. Chen and Z. Liu, On connected (g, f+1)-factors in graphs, Combinatorica 25(4)(2005), 393-405. https://doi.org/10.1007/s00493-005-0023-9
  9. G. Liu, B. Zhu, Some problems on factorizations with constraints in bipartite graphs, Discrete Applied Mathematics 128(2003), 421-434.
  10. S. Zhou and M. Zong, Randomly orthogonal factorizations of (0, mf - (m - 1)r)-graphs, Journal of the Korean Mathematical Society 45(6)(2008), 1613-1622. https://doi.org/10.4134/JKMS.2008.45.6.1613
  11. S. Zhou, H. Liu and Y. Xu, A degree condition for graphs to have connected (g, f)-factors, Bulletin of the Iranian Mathematical Society 35(1)(2009), 199-209.
  12. G. A. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc. 2(1952), 69-81. https://doi.org/10.1112/plms/s3-2.1.69
  13. P. Katerinis and N. Tsikopoulos, Minimum degree and F-factors in graphs, New Zealand J. Math. 29(2000), 33-40.