Supported by the National Natural Science Foundation of China(Grant No.11271230,11671232)
A graph is said to be claw-free if it does not contain an induced subgraph isomorphic to K_(1,3). Let s and k be two integers with 0≤s≤k and let G be a claw-free graph of order n. In this paper, we investigate cli...