Journal of applied mathematics & informatics

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

NEIGHBORHOOD CONDITION AND FRACTIONAL f-FACTORS IN GRAPHS

  • Liu, Hongxia (School of Mathematics and System Science, Shandong University) ;
  • Liu, Guizhen (School of Mathematics and System Science, Shandong University)
  • 발행 : 2009.09.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Let G be a graph with vertex set V(G) and let f be a nonnegative integer-valued function defined on V(G). A spanning subgraph F of G is called a fractional f-factor if $d^h_G$(x)=f(x) for all x $\in$ for all x $\in$ V (G), where $d^h_G$ (x) = ${\Sigma}_{e{\in}E_x}$ h(e) is the fractional degree of x $\in$ V(F) with $E_x$ = {e : e = xy $\in$ E|G|}. In this paper it is proved that if ${\delta}(G){\geq}{\frac{b^2(k-1)}{a}},\;n>\frac{(a+b)(k(a+b)-2)}{a}$ and $|N_G(x_1){\cup}N_G(x_2){\cup}{\cdots}{\cup}N_G(x_k)|{\geq}\frac{bn}{a+b}$ for any independent subset ${x_1,x_2,...,x_k}$ of V(G), then G has a fractional f-factor. Where k $\geq$ 2 be a positive integer not larger than the independence number of G, a and b are integers such that 1 $\leq$ a $\leq$ f(x) $\leq$ b for every x $\in$ V(G). Furthermore, we show that the result is best possible in some sense.

키워드

참고문헌

  1. B. Alspach, K. Heinrich, and G. Liu, Contemporary design theory-A Collection of Surveys, Wiley, New York, pp. (1992), 13-37.
  2. Q.J. Bian, On toughness and (g, f)-factors in bipartite graphs, J. Appl. Math. and Computing, 22 (2006), 299-304. https://doi.org/10.1007/BF02832055
  3. J.A. Bondy and U. S. R. Murty, Graph Theory with Applications, Macmillan, London, 1976.
  4. J.S. Cai and G.Z. Liu, Stability number and fractional f-factors in graphs, Ars Comb., 80 (2006), 141-146.
  5. J.X. Li, On neighborhood condition for graphs to have [a, b]-factors, Discrete Math., 260 (2003), 217-221. https://doi.org/10.1016/S0012-365X(02)00672-6
  6. Y.J. Li and M.C. Cai, A degree condition for a graph to have [a, b]-factors, J. Graph Theory, 27 (1998), 1-6. https://doi.org/10.1002/(SICI)1097-0118(199801)27:1<1::AID-JGT1>3.0.CO;2-U
  7. G.Z. Liu, (g < f)-factors of graphs, Acta Math. Sci.(China), 14 (1994), 285-290.
  8. G.Z. Liu and W.A. Zang, f-factors in bipartite (mf)-graphs, Discrete Appl. Math., 136 (2004), 45-54. https://doi.org/10.1016/S0166-218X(03)00197-5
  9. G.Z. Liu and L.J. Zhang, Fractional (g, f)-factors of graphs, Acta Math. Scientia Ser B 21(4) (2001), 541-545.
  10. H. Matsuda, A neighborhood condition for graphs to have [a, b]-factors, Discrete Math., 224 (2000), 289-292. https://doi.org/10.1016/S0012-365X(00)00140-0
  11. L.F. Mao, F. Tian, On oriented 2-factorable graphs, J. Appl. Math. & Computing, 17 (2005), 25-38. https://doi.org/10.1007/BF02936038
  12. M.D. Plummer, Graph factors and factorization, Chapter 5.4 in Hand-book on Graph Theory, Eds: J. Gross and R. Yellen, CRC Press, NewYork, (2003), 403-430.
  13. Edward R. Scheinerman and Daniel H. Ullman, Fractional Graph Theory, John Wiley and Sons, Inc. New York, 1997.
  14. W.T. Tutte, The factor of graphs, Can. J. Math., 4 (1952), 314-328. https://doi.org/10.4153/CJM-1952-028-2