Title of article :
A DEGREE CONDITION FOR GRAPHS TO HAVECONNECTED (g,f)-FACTORS dag
Author/Authors :
ZHOU, S. Jiangsu University of Science and Technology - School of Mathematics and Physics, China , LID, H Shandong University - School of Mathematics, China , XU, Y. Qingdao Agricultural University - Department of Mathematics, China
Abstract :
Let G be a graph of order n, a and b be integers with 1 a b and b≥3, g(x) and f(x) be two integer-valued functions defined on Y(G) such that a≤ g(x) ≤ f(x)≤ b, for each x E Y(G) and f(V(G)) - V(G) even. We prove that G has a connected (g,f) factor if the minimum degree σ(G) satisfies σ(G) ≥ b-1*n /a+b-l and n≥(a+b-l)^2+ 1/a
Journal title :
Bulletin of the Iranian Mathematical Society
Journal title :
Bulletin of the Iranian Mathematical Society
