Saturation Number for Linear Forest 2P3∪tP2

摘要

For a fixed graph F,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.In this paper,we determine the saturation number sat(n,2P3∪tP2)and characterize the extremal graphs for n≥6t+8.