分数(a,b,k)-临界覆盖图的独立数与连通度
组合数学
2019-09-04 v1
摘要
若对每個U⊆V(G)且|U|=k，G-U均为分数[a,b]-覆盖图，则称图G为分数(a,b,k)-临界覆盖图，该概念由Zhou、Xu和Sun首次定义（S. Zhou, Y. Xu, Z. Sun, Degree conditions for fractional (a,b,k)-critical covered graphs, Information Processing Letters, DOI: 10.1016/j.ipl.2019.105838）。此外，他们推导了图成为分数(a,b,k)-临界覆盖图的度条件。本文得到了图成为分数(a,b,k)-临界覆盖图的独立数与连通度条件，并验证了若则G为分数(a,b,k)-临界覆盖图。
关键词
引用
@article{arxiv.1909.01070,
title = {Independence number and connectivity for fractional (a,b,k)-critical covered graphs},
author = {Sizhong Zhou and Jiancheng Wu and Hongxia Liu},
journal= {arXiv preprint arXiv:1909.01070},
year = {2019}
}