2019/09/03 by Sizhong Zhou, Zhou, Sizhong, Jian-Cheng Wu +3
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Interconnection Networks and Systems #Optimization and Search Problems
paper · pdf · doi:10.48550/arxiv.1909.01070
openalex publication_date 2019/09/03 · openalex created_date 2022/08/28 · openalex updated_date 2026/07/28
A graph G is a fractional (a,b,k)-critical covered graph if G-U is a fractional [a,b]-covered graph for every U⊆ V(G) with |U|=k, which is first defined by Zhou, Xu and 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). Furthermore, they derived a degree condition for a graph to be a fractional (a,b,k)-critical covered graph. In this paper, we gain an independence number and connectivity condition for a graph to be a fractional (a,b,k)-critical covered graph and verify that G is a fractional (a,b,k)-critical covered graph if κ(G)≥max\(2b(a+1)(b+1)+4bk+5)/(4b),\frac(a+1)2α(G)+4bk+54b\.