Search Results for ""

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

Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...

A quantity that is divided by another quantity.

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

An even number N for which N=0 (mod 4). The first few positive doubly even numbers are 4, 8, 12, 16, ... (OEIS A008586).

The ending of a game in which neither of two players wins, sometimes also called a "tie." A game in which no draw is possible is called a categorical game.

A dual number is a number x+epsilony, where x,y in R and epsilon is a matrix with the property that epsilon^2=0 (such as epsilon=[0 1; 0 0]).

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

Let Jones and Smith be the only two contestants in an election that will end in a deadlock when all votes for Jones (J) and Smith (S) are counted. What is the expectation ...

136·2^(256) approx 1.575×10^(79). According to Eddington, the exact number of protons in the universe, where 136 was the reciprocal of the fine structure constant as best as ...