Title of article :
Neighborhood Conditions and Fractional k-Factors
Author/Authors :
Zhou, Sizhong Jiangsu University of Science and Technology - School of Mathematics and Physics, China , Liu, Hongxia Yantai University - School of Mathematics and Informational Science, China , Liu, Hongxia Shandong University - School of Mathematics, China
Abstract :
Let k be an integer such that k ≥ 1, and let G be a connected graph of order n such that n ≥ 9k − 1 − 4p2(k − 1)2 + 2, and the minimum degree delta (G) ≥ k. In this paper, it is proved that a graph G has a fractional k-factor if |NG(x) U NG(y)| ≥ max{n/2, (n + k − 2)/2} for each pair of non-adjacent vertices x, y element of V (G).
Keywords :
Graph , neighborhood condition , k , factor , fractional k , factor.
Journal title :
Bulletin of the Malaysian Mathematical Sciences Society
Journal title :
Bulletin of the Malaysian Mathematical Sciences Society
