- Tytuł:
- Weakly P-saturated graphs
- Autorzy:
-
Borowiecki, Mieczysław
Sidorowicz, Elżbieta - Powiązania:
- https://bibliotekanauki.pl/articles/743531.pdf
- Data publikacji:
- 2002
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
graph
extremal problems
hereditary property
weakly saturated graphs - Opis:
-
For a hereditary property let $k_{}(G)$ denote the number of forbidden subgraphs contained in G. A graph G is said to be weakly -saturated, if G has the property and there is a sequence of edges of G̅, say $e₁,e₂,...,e_l$, such that the chain of graphs $G = G₀ ⊂ G_0 + e₁ ⊂ G₁ + e₂ ⊂ ... ⊂ G_{l-1} + e_l = G_l = K_n(G_{i+1} = G_i + e_{i+1})$ has the following property: $k_{}(G_{i+1}) > k_{}(G_i)$, 0 ≤ i ≤ l-1.
In this paper we shall investigate some properties of weakly saturated graphs. We will find upper bound for the minimum number of edges of weakly ₖ-saturated graphs of order n. We shall determine the number wsat(n,) for some hereditary properties. - Źródło:
-
Discussiones Mathematicae Graph Theory; 2002, 22, 1; 17-29
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł