典型文献
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 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.
文献关键词：
中图分类号：
作者姓名：
Wei ZHANG;Su-fang WANG
作者机构：
School of Economics and Management,China University of Mining and Technology,Xuzhou 221116,China;School of Economics and Management,Wenzhou University of Technlogogy,Wenzhou 325000,China;School of Public Management,Jiangsu University of Science and Technology,Zhenjiang 212100,China
文献出处：
引用格式：
[1]Wei ZHANG;Su-fang WANG-.Discussion on Fractional(a,b,k)-critical Covered Graphs)[J].应用数学学报（英文版）,2022(02):304-311
A类：
Covered
B类：
Discussion,Fractional,critical,Graphs,called,fractional,covered,if,each,contains,covering,any,which,was,first,defined,investigated,by,Zhou,Xu,Sun,Degree,conditions,graphs,Information,Processing,Letters,this,work,we,proceed,study,derive,result,depending,minimum,degree,neighborhoods,independent,sets
AB值：
0.516582
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
