Search Results for ""

An automorphic graph is a distance-transitive graph Gamma for which the automorphism group Aut(Gamma) acts primitively on the vertices of Gamma and is not a complete graph or ...

The nth Beraha constant (or number) is given by B(n)=2+2cos((2pi)/n). B(5) is phi+1, where phi is the golden ratio, B(7) is the silver constant, and B(10)=phi+2. The ...

The Bernoulli distribution is a discrete distribution having two possible outcomes labelled by n=0 and n=1 in which n=1 ("success") occurs with probability p and n=0 ...

A bicubic graph is a bipartite cubic graph. Tutte (1971) conjectured that all 3-connected bicubic graphs are Hamiltonian (the Tutte conjecture), but a number of bicubic ...

The biggest little polygon with n sides is the convex plane n-gon of unit polygon diameter having largest possible area. Reinhardt (1922) showed that for n odd, the regular ...

A bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board). To form the ...

An incidence system (v, k, lambda, r, b) in which a set X of v points is partitioned into a family A of b subsets (blocks) in such a way that any two points determine lambda ...

A board is a subset of the polygons determined by a number of (usually regularly spaced and oriented) lines. These polygons form the spaces on which "pieces" can be placed ...

A two-dimensional binary (k=2) totalistic cellular automaton with a von Neumann neighborhood of range r=1. It has a birth rule that at least 2 of its 4 neighbors are alive, ...

A braid is an intertwining of some number of strings attached to top and bottom "bars" such that each string never "turns back up." In other words, the path of each string in ...