
The author investigates some properties of weakly saturated graphs, and gives some estimations for the minimum size of weakly \(P\)-saturated graphs.
Extremal problems in graph theory, Weakly saturated graphs, hereditary properties, weakly saturated graphs, Discrete Mathematics and Combinatorics, saturated graphs, Hereditary properties, Saturated graphs, Theoretical Computer Science
Extremal problems in graph theory, Weakly saturated graphs, hereditary properties, weakly saturated graphs, Discrete Mathematics and Combinatorics, saturated graphs, Hereditary properties, Saturated graphs, Theoretical Computer Science
| 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). | 7 | |
| 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). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
