期刊论文

Min Liu

英文

武汉大学自然科学学报(英文版)

1007-1202

2019

24

4

283-289

10.1007/s11859-019-1398-2

Supported by the National Natural Science Foundation of China（11071096,11171129）； the Natural Science Foundation of Hubei Province（2016CFB146）； Research Foundation of College of Economics,Northwest University of Political Science and Law（19XYKY07）；

本校为其他机构

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$\left( {n,F} \right)$, 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$\left( {n,2{P_3} \cup t{P_2}} \right)$ and ch...