Browse > Article

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)
Publication Information
Journal of applied mathematics & informatics / v.28, no.3_4, 2010 , pp. 909-912 More about this Journal
Abstract
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.
Keywords
Graph; order; minimum degree; (g, f)-factor; connected (g, f)-factor;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 G. A. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc. 2(1952), 69-81.   DOI
2 P. Katerinis and N. Tsikopoulos, Minimum degree and F-factors in graphs, New Zealand J. Math. 29(2000), 33-40.
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.   DOI
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.   DOI   ScienceOn
7 M. Kouider and P. D. Vestergaard, Connected factors in graphs - a survey, Graphs and Combinatorics 21(2005), 1-26.   DOI   ScienceOn
8 G. Li, Y. Xu, C. Chen and Z. Liu, On connected (g, f+1)-factors in graphs, Combinatorica 25(4)(2005), 393-405.   DOI   ScienceOn
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.   과학기술학회마을   DOI   ScienceOn
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 S. Zhou, Independence number, Connectivity and (a, b, k)-critical graphs, Discrete Mathematics 309(12)(2009), 4144-4148.   DOI   ScienceOn
13 J. R. Correa and M. Matamala, Some remarks about factors of graphs, Journal of Graph Theory 57(2008), 265-274.   DOI   ScienceOn