Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Discussion on Fractional (a, b, k)-critical Covered Graphs

Discussion on Fractional (a, b, k)-critical Covered Graphs A graph G is called a fractional [a, b]-covered graph if for each e ∈ E(G), G contains a fractional [a, b]-factor covering e. A graph G is called a fractional (a, b, k)-critical covered graph if for any W ⊆ V(G) with |W| = k, G − W is fractional [a, b]-covered, which was first defined and investigated by Zhou, Xu and Sun [S. Zhou, Y. Xu, Z. Sun, Degree conditions for fractional (a, b, k)-critical covered graphs, Information Processing Letters 152(2019)105838]. In this work, we proceed to study fractional (a, b, k)-critical covered graphs and derive a result on fractional (a, b, k)-critical covered graphs depending on minimum degree and neighborhoods of independent sets. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png "Acta Mathematicae Applicatae Sinica, English Series" Springer Journals

Discussion on Fractional (a, b, k)-critical Covered Graphs

Loading next page...
 
/lp/springer-journals/discussion-on-fractional-a-b-k-critical-covered-graphs-pbpM5x3vGO

References (36)

Publisher
Springer Journals
Copyright
Copyright © The Editorial Office of AMAS & Springer-Verlag GmbH Germany 2022. corrected publication 2022
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/s10255-022-1076-6
Publisher site
See Article on Publisher Site

Abstract

A graph G is called a fractional [a, b]-covered graph if for each e ∈ E(G), G contains a fractional [a, b]-factor covering e. A graph G is called a fractional (a, b, k)-critical covered graph if for any W ⊆ V(G) with |W| = k, G − W is fractional [a, b]-covered, which was first defined and investigated by Zhou, Xu and Sun [S. Zhou, Y. Xu, Z. Sun, Degree conditions for fractional (a, b, k)-critical covered graphs, Information Processing Letters 152(2019)105838]. In this work, we proceed to study fractional (a, b, k)-critical covered graphs and derive a result on fractional (a, b, k)-critical covered graphs depending on minimum degree and neighborhoods of independent sets.

Journal

"Acta Mathematicae Applicatae Sinica, English Series"Springer Journals

Published: Apr 1, 2022

Keywords: network; fractional (a, b, k)-critical covered graph; minimum degree; neighborhood of independent set; 05C70; 90B18

There are no references for this article.