INDEPENDENCE NUMBER AND CONNECTIVITY FOR FRACTIONAL (a, b, k)-CRITICAL COVERED GRAPHS

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 subset of V(G) with |U| - K, which is first defined by (Zhou, Xu and Sun, Inf. Process. Lett. 152 (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 k(G) >= max {2b(a + 1)(b + 1) + 4bk + 5/4b, (a + 1)(2)alpha(G) + 4bk +5/4b}.