- Tytuł:
- Weakly connected domination critical graphs
- Autorzy:
-
Lemańska, M.
Patyk, A. - Powiązania:
- https://bibliotekanauki.pl/articles/255051.pdf
- Data publikacji:
- 2008
- Wydawca:
- Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
- Tematy:
-
weakly connected domination number
tree
critical graphs - Opis:
- A dominating set D ⊂ V(G) is a weakly connected dominating set in G if the subgraph G[D]w = (NG[D], Ew) weakly induced by D is connected, where Ew is the set of all edges with at least one vertex in D. The weakly connected domination number ϒw(G) of a graph G is the minimum cardinality among all weakly connected dominating sets in G. The graph is said to be weakly connected domination critical (ϒw-critical) if for each u, v ∈ V(G) with v not adjacent to u, ϒw(G + vu) < ϒw(G). Further, G is k- ϒw-critical if ϒw(G) = k and for each edge e ∉ E(G), ϒw(G + e) < k. In this paper we consider weakly connected domination critical graphs and give some properties of 3-ϒw,-critical graphs.
- Źródło:
-
Opuscula Mathematica; 2008, 28, 3; 325-330
1232-9274
2300-6919 - Pojawia się w:
- Opuscula Mathematica
- Dostawca treści:
- Biblioteka Nauki