- Tytuł:
- Weakly connected domination subdivision numbers
- Autorzy:
- Raczek, Joanna
- Powiązania:
- https://bibliotekanauki.pl/articles/743529.pdf
- Data publikacji:
- 2008
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
weakly connected domination number
weakly connected domination subdivision number - Opis:
- A set D of vertices in a graph G = (V,E) is a weakly connected dominating set of G if D is dominating in G and the subgraph weakly induced by D is connected. The weakly connected domination number of G is the minimum cardinality of a weakly connected dominating set of G. The weakly connected domination subdivision number of a connected graph G is the minimum number of edges that must be subdivided (where each egde can be subdivided at most once) in order to increase the weakly connected domination number. We study the weakly connected domination subdivision numbers of some families of graphs.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2008, 28, 1; 109-119
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł