Affiliation:
1. School of Economics and management, Jiangsu University of Science and Technology, Zhenjiang, Jiangsu, China
Abstract
A graph G is fractional [a, b]-covered if for any e ? E(G), G possesses a
fractional [a, b]-factor including e. A graph G is fractional (a, b,
k)-critical covered if G ? Q is fractional [a, b]-covered for any Q ? V(G)
with |Q| = k. In this paper, we verify that a graph G of order n is
fractional (a, b, k)-critical covered if n ? (a+b)((2r?3)a+b+r?2)+bk+2 b ,
?(G) ? (r ? 1)(a + 1) + k and max{dG(w1), dG(w2),..., dG(wr)} ? an + bk
+ 2 a + b for every independent vertex subset {w1,w2,... ,wr} ofG. Our
main result is an improvement of the previous result [S. Zhou, Y. Xu, Z.
Sun, Degree conditions for fractional (a, b, k)-critical covered graphs,
Information Processing Letters 152(2019)105838].
Publisher
National Library of Serbia
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Isolated toughness for fractional (2;b;k)-critical covered graphs;Proceedings of the Romanian Academy, Series A: Mathematics, Physics, Technical Sciences, Information Science;2023-11-15