Saturation numbers for linear forests P₆ + tP₂

Abstract: A graph

G

is

H

-saturated if it contains no

H

as a subgraph, but does contain

H

after the addition of any edge in the complement of

G

. The saturation number,

s a t (n, H)

, is the minimum number of edges of a graph in the set of all

H

-saturated graphs with order

n

. In this paper, we determine the saturation number

s a t (n, P_{6} + t P_{2})

for

n g e q 10 t / 3 + 10

and characterize the extremal graphs for

n > 10 t / 3 + 20

.

This page was built for publication: Saturation numbers for linear forests $P_6 + tP_2$