2000 character limit reached
A tight $Q$-index condition for a graph to be $k$-path-coverable involving minimum degree (2109.07347v1)
Published 15 Sep 2021 in math.CO and math.SP
Abstract: A graph $G$ is $k$-path-coverable if its vertex set $V(G)$ can be covered by $k$ or fewer vertex disjoint paths. In this paper, using the $Q$-index of a connected graph $G$, we present a tight sufficient condition for $G$ with fixed minimum degree and large order to be $k$-path-coverable.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.