Author:
ZHOU Sizhong, ,PAN Quanru,XU Lan, ,
Abstract
"A graph G is called a fractional (a,b,k)-critical covered graph if for any Q ⊆ V(G) with |Q|=k, G−Q is a fractional [a,b]-covered graph. In particular, a fractional (a,b,k)-critical covered graph is a fractional (2,b,k)-critical covered graph if a=2. In this work, we investigate the problem of a fractional (2,b,k)-critical covered graph, and demonstrate that a graph G with δ(G)≥3+k is fractional (2,b,k)-critical covered if its isolated toughness I(G)≥1+(k+2)/(b−1), where b and k are nonnegative integers satisfying b≥2+(k/2)."
Subject
General Computer Science,General Mathematics,General Engineering,General Physics and Astronomy
Reference39 articles.
1. "1. C. CHEN, Toughness of graphs and [2,b]-factors, Graphs and Combinatorics, 10, pp. 97-100, 1994.
2. 2. S. CHIBA, On degree sum conditions for 2-factors with a prescribed number of cycles, Discrete Mathematics, 341, pp. 2912-2918, 2018.
3. 3. W. GAO, J. GUIRAO, Y. CHEN, A toughness condition for fractional (k,m)-deleted graphs revisited, Acta Mathematica Sinica, English Series, 35, pp. 1227-1237, 2019.
4. 4. W. GAO, L. LIANG, Y. CHEN, An isolated toughness condition for graphs to be fractional (k,m)-deleted graphs, Utilitas Mathematica, 105, pp. 303-316, 2017.
5. 5. W. GAO, W. WANG, D. DIMITROV, Toughness condition for a graph to be all fractional (g, f ,n)-critical deleted, Filomat, 33, 9, pp. 2735-2746, 2019.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献