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

• 作者: Wei ZHANG Su-fang WANG
• 来源期刊: 应用数学学报（英文版）
• 年，卷（期）: 2022,（2）
• 页码范围: 304-311
• 页数: 8页
• 语种: 英文

摘要

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 C 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.