Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Odd and residue domination numbers of a graph

100%

Caro Y., Klostermeyer W., Goldwasser J.

Discussiones Mathematicae Graph Theory

2001

tom 21

nr 1

119-136

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Caro Y.

1 Goldwasser J.

1 Klostermeyer W.

1 2001

Wyniki wyszukiwania

Odd and residue domination numbers of a graph