E-viri
PDF
Recenzirano
Odprti dostop
-
Song, Feifei; Zou, Yan; Su, Hengdi
Mathematical problems in engineering, 2021, Letnik: 2021Journal Article
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∉EG. The saturation number, denoted by satn,F, is the minimum size of a graph with order n in all F-saturated graphs. For n≥6t+22, this paper considers the saturation number of linear forests 2P4∪tP2 and describes the extremal graph.
