Toughness condition for the existence of all fractional (a, b, k)-critical graphs

被引：7
作者：
Yuan, Yuan [1 ]
Hao, Rong-Xia [1 ]
机构：
[1] Beijing Jiaotong Univ, Dept Math, Beijing 100044, Peoples R China
来源：
DISCRETE MATHEMATICS | 2019年 / 342卷 / 08期
基金：
中国国家自然科学基金;
关键词：
Network; Graph; Toughness; All fractional (a; b; k)-critical graph; ORTHOGONAL FACTORIZATIONS; INDEPENDENCE NUMBER; CONNECTIVITY; F)-FACTORS; (G;
D O I：
10.1016/j.disc.2019.05.004
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this article, we obtain a sufficient condition related to toughness r(G) for a graph to be all fractional (a, b, k)-critical. We prove that if tau(G) >= (b(2)-1)+ak/a for some nonnegative integers a, b, k, then G is all fractional (a, b, k)-critical. Our result improves the known results in Liu and Zhang (2008) and Liu and Cai (2009). (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码：2308 / 2314
页数：7
相关论文
共 15 条
12