Search Results for ""

The maximum number of disjoint dominating sets in a domatic partition of a graph G is called its domatic number d(G). The domatic number should not be confused with the ...

A domatic partition is a partition of the vertices of a graph into disjoint dominating sets. The maximum number of disjoint dominating sets in a domatic partition of a graph ...

The dominance relation on a set of points in Euclidean n-space is the intersection of the n coordinate-wise orderings. A point p dominates a point q provided that every ...

For a graph G and a subset S of the vertex set V(G), denote by N_G[S] the set of vertices in G which are in S or adjacent to a vertex in S. If N_G[S]=V(G), then S is said to ...

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...

Let d_G(k) be the number of dominating sets of size k in a graph G, then the domination polynomial D_G(x) of G in the variable x is defined as ...

A two-player game, also called crosscram, in which player H has horizontal dominoes and player V has vertical dominoes. The two players alternately place a domino on a board ...

The domino is the unique free (and one-sided) 2-polyomino consisting of two equal squares connected along a complete polygon edge. There are two fixed dominoes.

The domino graph is the graph on 6 vertices illustrated above. It is isomorphic to the 3-ladder graph and the (2,3)-grid graph. It is implemented in the Wolfram Language as ...

The Fibonacci number F_(n+1) gives the number of ways for 2×1 dominoes to cover a 2×n checkerboard, as illustrated in the diagrams above (Dickau). The numbers of domino ...