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

作　　者：Si-zhong ZHOU 

机构地区：[1]School of Science,Jiangsu University of Science and Technology,Zhenjiang,212100,China

出　　处：《Acta Mathematicae Applicatae Sinica》2021年第4期657-664,共8页应用数学学报（英文版）

基　　金：This work is supported by Six Big Talent Peak of Jiangsu Province,China(Grant No.JY-022).

摘　　要：A fractional[a,b]-factor of a graph G is a function h from E(G)to[0,1]satisfying a≤d^(h)_(G)(v)≤b for every vertex v of G,where d^(h)_(G)(v)=∑e∈E(v)h(e)and E(v)={e=uv:u∈V(G)}.A graph G is called fractional[a,b]-covered if G contains a fractional[a,b]-factor h with h(e)=1 for any edge e of G.A graph G is called fractional(a,b,k)-critical covered if G—Q is fractional[a,b]-covered for any Q⊆V(G)with∣Q∣=k.In this article,we demonstrate a neighborhood condition for a graph to be fractional(a,b,k)-critical covered.Furthermore,we claim that the result is sharp.

关 键 词：GRAPH NEIGHBORHOOD fractional[a 6]-factor fractional[a.6]-covered graph fractional(a.b k)-critical covered graph 

分 类 号：O157.5[理学—数学]