Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Odd and residue domination numbers of a graph

Yair Caro;  William F. Klostermeyer;  John L. Goldwasser — 2001

Discussiones Mathematicae Graph Theory

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.

Page 1

Download Results (CSV)