DEGREE SUM CONDITION FOR FRACTIONAL ID-k-FACTOR-CRITICAL GRAPHS

被引：24

作者：

Gao, Wei ^{[1
]}

Wang, Weifan ^{[2
]}

机构：

[1] Yunnan Normal Univ, Sch Informat Sci & Technol, Kunming 650500, Yunnan, Peoples R China

[2] Zhejiang Normal Univ, Dept Math, Jinhua 321004, Peoples R China

来源：

MISKOLC MATHEMATICAL NOTES | 2017年 / 18卷 / 02期

关键词：

graph; fractional factor; fractional ID-k-factor-critical graph; degree sum; M)-DELETED GRAPHS; (K;

D O I：

10.18514/MMN.2017.1264

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A graph G is called a fractional ID-k-factor-critical graph if after deleting any independent set of G the resulting graph admits a fractional k-factor. In this paper, we prove that for k >= 2, G is a fractional ID-k-factor-critical graph if delta (G) >= n/3 + k, sigma(2)(G) >= 4n/3, n >= 6k - 8. The result is best possible in some sense.

引用

页码：751 / 758

页数：8

共 11 条

[1]

Chang RY, 2010, B MALAYS MATH SCI SO, V33, P355

[2] NEW ISOLATED TOUGHNESS CONDITION FOR FRACTIONAL (g, f, n) - CRITICAL GRAPH [J].

Gao, Wei ;

Wang, Weifan .

COLLOQUIUM MATHEMATICUM, 2017, 147 (01) :55-65

[3] The Vertex Version of Weighted Wiener Number for Bicyclic Molecular Structures [J].

Gao, Wei ;

Wang, Weifan .

COMPUTATIONAL AND MATHEMATICAL METHODS IN MEDICINE, 2015, 2015

[4]

Gao W, 2014, ARS COMBINATORIA, V113A, P273

[5]

Gao W, 2014, ARS COMBINATORIA, V113A, P225

[6]

Gao W, 2014, ARS COMBINATORIA, V113A, P49

[7] AN ORE-TYPE CONDITION FOR THE EXISTENCE OF K-FACTORS IN GRAPHS [J].

IIDA, T ;

NISHIMURA, T .

GRAPHS AND COMBINATORICS, 1991, 7 (04) :353-361

[8]

Jin J. H., 2016, APPL MATH NONLINEAR, V1, P229

[9]

Niessen T, 1997, ARS COMBINATORIA, V46, P277

[10]

[YU Jiguo 禹继国], 2006, [数学进展, Advances in Mathematics], V35, P621

← 1 2 →