
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.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
