Improvement of the previous result on fractional (a,b,k)-critical covered graphs
Publication details: New Delhi Springer 2024Edition: Vol.55(1), MarDescription: 40-46pSubject(s): Online resources: In: Indian journal of pure and applied mathematicsSummary: 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.| Item type | Current library | Status | Barcode | |
|---|---|---|---|---|
Articles Abstract Database
|
School of Engineering & Technology Archieval Section | Not for loan | 2024-1547 |
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.
There are no comments on this title.
Click on an image to view it in the image viewer