- Tytuł:
- Efficient (j,k)-domination
- Autorzy:
-
Rubalcaba, Robert
Slater, Peter - Powiązania:
- https://bibliotekanauki.pl/articles/743411.pdf
- Data publikacji:
- 2007
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
efficient domination
multiple domination - Opis:
- A dominating set S of a graph G is called efficient if |N[v]∩ S| = 1 for every vertex v ∈ V(G). That is, a dominating set S is efficient if and only if every vertex is dominated exactly once. In this paper, we investigate efficient multiple domination. There are several types of multiple domination defined in the literature: k-tuple domination, {k}-domination, and k-domination. We investigate efficient versions of the first two as well as a new type of multiple domination.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2007, 27, 3; 409-423
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł