Saturation Numbers for Linear Forests P₇+tP₂

Let H be a fixed graph, a graph G is H-saturated if it has no copy of H in G, but the addition of any edge in E( G) to G results in an H-subgraph. The saturation number sat$(n,H)$ is the minimum number of edges in an H-saturated graph on n vertices. In this paper, we determine the saturation number sat(n,P₇+tP₂) for n≥ 14/5t+27 and characterize the extremal graphs for n≥ 14/13(3t+25).