- Tytuł:
- Odd and residue domination numbers of a graph
- Autorzy:
-
Caro, Yair
Klostermeyer, William
Goldwasser, John - Powiązania:
- https://bibliotekanauki.pl/articles/743442.pdf
- Data publikacji:
- 2001
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
dominating set
odd dominating set
parity domination - Opis:
- Let G = (V,E) be a simple, undirected graph. A set of vertices D is called an odd dominating set if |N[v] ∩ D| ≡ 1 (mod 2) for every vertex v ∈ V(G). The minimum cardinality of an odd dominating set is called the odd domination number of G, denoted by γ₁(G). In this paper, several algorithmic and structural results are presented on this parameter for grids, complements of powers of cycles, and other graph classes as well as for more general forms of "residue" domination.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2001, 21, 1; 119-136
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł