total dominating set (or strongly-dominating set) is a set of vertices such that all vertices in the graph, including the vertices in the dominating set themselves...

the set is known as a dominating set. Thus the Smith set is also called the smallest dominating set. The Schwartz set is equivalent to the Smith set, except...

all connected dominating sets of G. The connected domination number of G is the number of vertices in the minimum connected dominating set. Any spanning...

In graph theory, an eternal dominating set for a graph G = (V, E) is a subset D of V such that D is a dominating set on which mobile guards are initially...

dominating set for a graph G = (V, E) is a subset D ⊆ E such that every edge not in D is adjacent to at least one edge in D. An edge dominating set is...

set {a, c}. In this same graph, the maximal cliques are the sets {a, b} and {b, c}. A MIS is also a dominating set in the graph, and every dominating...

selecting a set of vertices (the dominating set) in a graph such that all other vertices are adjacent to at least one vertex in the dominating set. The Dominating...

matching with k edges is an edge dominating set with k edges. Conversely, if we are given a minimum edge dominating set with k edges, we can construct a...

number: GT3  Dominating set, a.k.a. domination number: GT2  NP-complete special cases include the edge dominating set problem, i.e., the dominating set problem...

convergence theorem, application of function domination in measure theory Dominating set, in graph theory Domination (angel), in Christian angelology The Domination...

(1) a maximal independent set is a dominating set, and (2) the complement of a maximal independent set is also a dominating set if there are no isolated...

dominating sets. The domatic number of the graph is the maximum number of dominating sets in such a partition. dominating A dominating set is a set of...

relations of this subject with square-blocking subsets and with perfect dominating sets (see below) in hypercubes were addressed by Dejter et al. since 1991...

funnel while the other would collect data from comparing the two sets of data. Dominator 2 features reinforced sheet metal and transparent Lexan has been...

this μ-null set N, so the theorem continues to hold. DCT holds even if fn converges to f in measure (finite measure) and the dominating function is non-negative...

chessboard. Dominating sets represent arrangements of queens where every square is attacked or occupied by a queen; five queens, but no fewer, can dominate the...

finding the smallest index i such that Gi has a dominating set of size at most k. Although Dominating Set is NP-complete, the k-center problem remains NP-hard...

Subset sum problem Clique problem Vertex cover problem Independent set problem Dominating set problem Graph coloring problem Sudoku To the right is a diagram...

vertices of the graph. It may also be called a dominating vertex, as it forms a one-element dominating set in the graph. A graph that contains a universal...

graphs. Edge dominating set, dominating set, r-dominating set, connected dominating set, r-scattered set, minimum maximal matching, independent set, maximum...

graphs. These include the minimum dominating set, minimum connected dominating set, and minimum total dominating set problems. The chromatic number of...

another independent set is called maximal. Such sets are dominating sets. Every graph contains at most 3n/3 maximal independent sets, but many graphs have...

and states that, if γ(G) denotes the minimum number of vertices in a dominating set for the graph G, then γ ( G ◻ H ) ≥ γ ( G ) γ ( H ) . {\displaystyle...

reaches a dominating set no larger than D {\displaystyle D} , so in particular when the starting set D {\displaystyle D} is a minimum dominating set this process...

Guha designed an approximation algorithms for the minimum connected dominating set problem that achieves a factor of 2 ln Δ + O(1), where Δ is the maximum...

to various set cover problems on subsets of vertices/subgraphs. Dominating set problem is the special case of set cover problem where sets are the closed...

sequences for synthetic biology and metabolic engineering applications. Dominating set Gallai 1959. Vazirani 2003, pp. 121–122 Garey, Johnson & Stockmeyer...

2009). "Mobile Ad Hoc Network (MANET) Extension of OSPF Using Connected Dominating Set (CDS) Flooding". doi:10.17487/RFC5614. {{cite journal}}: Cite journal...

relaxations of the set cover problem, the vertex cover problem, and the dominating set problem are also covering LPs. Finding a fractional coloring of a graph...

outside of the subset. Equivalently, a nonblocker is the complement of a dominating set. The computational problem of finding the largest nonblocker in a graph...