Toughness and fractional critical deleted graph

被引：1

作者：

Gao, Wei ^{[1
]}

Wang, Weifan ^{[2
]}

机构：

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

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

来源：

UTILITAS MATHEMATICA | 2015年 / 98卷

关键词：

toughness; fractional; (g; f)-factor; f; n)-critical graph; n)-critical deleted graph; (a; b; K-FACTORS; EXISTENCE;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper, we present the relationship between toughness and fractional critical deleted graphs. It is determined that G is fractional (g, f, n)-critical deleted if t(G) >= b(2)-Delta-1+bn/a, where 1 <= a <= b, b >= 2 and (a, b) not equal (1, 2). Furthermore, we derive a toughness bound for fractional (a, b, n)-critical deleted graphs. These results expand previous results published in The Scientific World Journal and Ars Combinatoria, respectively.

引用

页码：295 / 310

页数：16

共 13 条

[1]

Bian QJ, 2008, ARS COMBINATORIA, V87, P175

[2]

Bondy J.A., 2008, GTM

[3]

Chvatal V., 1973, Discrete Mathematics, V5, P215, DOI 10.1016/0012-365X(73)90138-6

[4]

Gao W, 2012, THESIS SOOCHOW U

[5]

Gao W., ARS COMBIN IN PRESS

[6]

Gao W., SCI WORLD J, V2014

[7]

Gao W, 2014, ARS COMBINATORIA, V113A, P49

[8] Toughness and the existence of fractional k-factors of graphs [J].

Liu, Guizhen ;

Zhang, Lanju .

DISCRETE MATHEMATICS, 2008, 308 (09) :1741-1748

[9] On toughness and fractional (g, f, n)-critical graphs [J].

Liu, Shuli .

INFORMATION PROCESSING LETTERS, 2010, 110 (10) :378-382

[10]

Liu SL, 2009, ARS COMBINATORIA, V93, P305

← 1 2 →