Saturation Numbers for Linear ForestsP5 ∪ tP2

A graph G is F-saturated if it has no F as a subgraph, but does contain F after the addition of any new edge. The saturation number, sat(n, F), is the minimum number of edges of a graph in the set of all F-saturated graphs with order n .I n this paper, we determine the saturation number sat(n, P5 ∪ tP2) for n ≥ 3t + 8 and characterize the extremal graphs for n >( 18t + 76)/5.