Search Results for ""

A connected dominating set in a connected graph G is a dominating set in G whose vertices induce a connected subgraph, i.e., one in which there is no dominating vertex not ...

A diagonal matrix D=diag(d_1,...,d_n) sometimes also called the valency matrix corresponding to a graph that has the vertex degree of d_i in the ith position (Skiena 1990, p. ...

A path gamma is a continuous mapping gamma:[a,b]|->C^0, where gamma(a) is the initial point, gamma(b) is the final point, and C^0 denotes the space of continuous functions. ...

Backgammon is a board game played by two players. The backgammon board is divided into four sections of six triangular regions on which pieces may be placed. Brown and white ...

The problem of finding the number of different ways in which a product of n different ordered factors can be calculated by pairs (i.e., the number of binary bracketings of n ...

An infinite sequence of circles such that every four consecutive circles are mutually tangent, and the circles' radii ..., R_(-n), ..., R_(-1), R_0, R_1, R_2, R_3, R_4, ..., ...

The dodecahedron has four stellations: the original dodecahedron, small stellated dodecahedron, great dodecahedron, and great stellated dodecahedron (Wenninger 1989, pp. 35 ...

Efron's dice are set of four nontransitive dice such that the probabilities of A winning against B, B against C, C against D, and D against A are all the same. The images ...

Given triangle DeltaABC, there are four lines simultaneously tangent to the B- and C-excircles (with centers J_B and J_C, respectively). Of these, three correspond to the ...

The Fields Medals are commonly regarded as mathematics' closest analog to the Nobel Prize (which does not exist in mathematics), and are awarded every four years by the ...