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 ...

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 ...

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.

A theorem proved by Doob (1942) which states that any random process which is both normal and Markov has the following forms for its correlation function C_y(tau), spectral ...

The Doro graph is a distance-transitive and Distance-Regular Graph on 68 vertices and with valency 12. It is the unique automorphic graph having intersection array ...

A dot plot, also called a dot chart, is a type of simple histogram-like chart used in statistics for relatively small data sets where values fall into a number of discrete ...

The Dou circle is the circle cutting the sidelines of the reference triangle DeltaABC at A^', A^(''), B^', B^(''), C^', and C^('') such that ...

An fairly good numerical integration technique. The method is also available in the Wolfram Language using the option Method -> DoubleExponential to NIntegrate.

A double factorial prime is a prime number of the form n!!+/-1, where n!! is a double factorial. n!!-1 is prime for n=3, 4, 6, 8, 16, 26, 64, 82, 90, 118, 194, 214, 728, ... ...

The double graph of a given graph G is constructed by making two copies of G (including the initial edge set of each) and adding edges u_1v_2 and v_1u_2 for every edge uv of ...