Improvement of the previous result on fractional (a,b,k)-critical covered graphs
Xiangyang, Lv
Improvement of the previous result on fractional (a,b,k)-critical covered graphs - Vol.55(1), Mar - New Delhi Springer 2024 - 40-46p.
A graph G is called fractional [a, b]-covered if for every , G has a fractional [a, b]-factor containing e. A graph G is called fractional (a, b, k)-critical covered if after deleting any k vertices of G, the remaining graph of G is fractional [a, b]-covered. In this paper, we pose a Fan-type condition for a graph being fractional (a, b, k)-critical covered, which is an improvement of Zhou, Xu and Sun’s previous result [S. Zhou, Y. Xu, Z. Sun, Degree conditions for fractional (a, b, k)-critical covered graphs, Information Processing Letters 152(2019)105838]. Furthermore, we claim that the main result in this paper is best possible in some sense.
Humanities and Applied Sciences
Improvement of the previous result on fractional (a,b,k)-critical covered graphs - Vol.55(1), Mar - New Delhi Springer 2024 - 40-46p.
A graph G is called fractional [a, b]-covered if for every , G has a fractional [a, b]-factor containing e. A graph G is called fractional (a, b, k)-critical covered if after deleting any k vertices of G, the remaining graph of G is fractional [a, b]-covered. In this paper, we pose a Fan-type condition for a graph being fractional (a, b, k)-critical covered, which is an improvement of Zhou, Xu and Sun’s previous result [S. Zhou, Y. Xu, Z. Sun, Degree conditions for fractional (a, b, k)-critical covered graphs, Information Processing Letters 152(2019)105838]. Furthermore, we claim that the main result in this paper is best possible in some sense.
Humanities and Applied Sciences