Hits :

First Author : Gao, W

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2014-01-01

Document Type : 期刊

Journal : ARS COMBINATORIA

Volume: Vol.113A

Page Number : 129-137

ISSN : 0381-7032

Translation or Not : no

Key Words : graph;fractional;(g,;f)-factor;fractional;(g,;f,;m)-deleted;graph;neighborhood;union;condition

Abstract : A graph G is called a fractional (g, f, m)-deleted graph if after deleting any m edges then the resulting graph admits a fractional (g, f)-factor. In this paper, we prove that if G is a graph of order n, and if 1 = b(2)(i-1)/a + 2m, n > (a+b)(i(a+b)+2m-2)