Search Results for ""

The complete bipartite graph K_(1,3) is a tree known as the "claw." It is isomorphic to the star graph S_4, and is sometimes known as the Y graph (Horton and Bouwer 1991; ...

A game played with two dice. If the total is 7 or 11 (a "natural"), the thrower wins and retains the dice for another throw. If the total is 2, 3, or 12 ("craps"), the ...

The phrase dependent percolation is used in two-dimensional discrete percolation to describe any general model in which the states of the various graph edges (in the case of ...

The Foster cage is one of the four (5,5)-cage graphs. Like the other (5,5)-cages, the Foster cage has 30 nodes. It has 75 edges, diameter 3, girth 5, chromatic number 4, and ...

There are a number of mathematical curves that produced heart shapes, some of which are illustrated above. A "zeroth" curve is a rotated cardioid (whose name means ...

There are at least two maps known as the Hénon map. The first is the two-dimensional dissipative quadratic map given by the coupled equations x_(n+1) = 1-alphax_n^2+y_n (1) ...

An edge-magic graph is a labeled graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex is the ...

Several prizes are awarded periodically for outstanding mathematical achievement. There is no Nobel Prize in mathematics, and the most prestigious mathematical award is known ...

There are a number of attractive polyhedron compounds consisting of five octahedra. The first octahedron 5-compound is a polyhedron compound composed of five octahedra ...

The lines containing the three points of the intersection of the three pairs of opposite sides of a (not necessarily regular) hexagon. There are 6! (i.e., 6 factorial) ...