Search Results for ""

A very general theorem that allows the number of discrete combinatorial objects of a given type to be enumerated (counted) as a function of their "order." The most common ...

A Room square (named after T. G. Room) of order n (for n even) is an arrangement in an (n-1)×(n-1) square matrix of n objects such that each cell is either empty or holds ...

A square pyramid is a pyramid with a square base. It is a pentahedron. The lateral edge length e and slant height s of a right square pyramid of side length a and height h ...

The number of colors sufficient for map coloring on a surface of genus g is given by the Heawood conjecture, chi(g)=|_1/2(7+sqrt(48g+1))_|, where |_x_| is the floor function. ...

A planar graph G is said to be triangulated (also called maximal planar) if the addition of any edge to G results in a nonplanar graph. If the special cases of the triangle ...

Consider the solid enclosed by the three hyperboloids specified by the inequalities x^2+y^2-z^2 <= 1 (1) y^2+z^2-x^2 <= 1 (2) z^2+x^2-y^2 <= 1. (3) This work dubs this solid ...

The smallest possible number of vertices a polyhedral nonhamiltonian graph can have is 11, and there exist 74 such graphs. The Goldner-Harary graph (Goldner and Harary 1975a, ...

An official chessboard is an 8×8 board containing squares alternating in color between olive green and buff (where "buff" is a color variously defined as a moderate orange ...

In general, the word "complement" refers to that subset F^' of some set S which excludes a given subset F. Taking F and its complement F^' together then gives the whole of ...

The cuboctahedral graph is an Archimedean quartic symmetric graph on 12 nodes and 24 edges that is the skeleton of the cuboctahedron, as well as the uniform ...