Search Results for ""

A formal description of the constraints on the possible configurations of an experiment which is subject to given conditions. A design is sometimes called an experimental ...

The desmic configuration is three-dimensional configuration of points consisting of three tetrads of points, each two of the tetrads of which are perspective from the four ...

A diafix of a string T=s_1s_2...s_N is a substring s_(i+1)...s_(N-i) (0<=i<N/2). It is therefore not a first (prefix) or last (suffix) part of a string, but rather is a ...

A Ramsey number of the form R(k,k;2).

The shortest path-spanning tree from a graph vertex of a graph.

The order-n dipole graph D_n is a multigraph consisting of two vertices and n multiple edges joining them. The dipole graph D_2 is a multigraph that can be considered to ...

The disorder number of a simple connected graph on n vertices is defined as the maximum length of a walk along the edges of the graph taken over all ordering of its vertices ...

The Dürer graph is the skeleton of Dürer's solid, which is the generalized Petersen graph GP(6,2). It is illustrated above in a number of embeddings. It is implemented in the ...

The edge multiplicity of a given end vertex in a multigraph is the number of multiple edges sharing that end vertex. The maximum edge multiplicity in such a graph is known as ...

Edge splitting is the reverse of edge contraction.