Saturation Numbers for Linear Forests 2 P 4 ∪ t P 2

For a given graph F , graph G is called F -saturated if G does not contain a copy of F , but G + e has a copy of F , where e ∉ E G . The saturation number, denoted by sat n , F , is the minimum size of a graph with order n in all F -saturated graphs. For n ≥ 6 t + 22 , this paper considers the saturation number of linear forests 2 P 4 ∪ t P 2 and describes the extremal graph.