Search Results for ""

A bicolorable graph G is a graph with chromatic number chi(G)<=2. A graph is bicolorable iff it has no odd graph cycles (König 1950, p. 170; Skiena 1990, p. 213; Harary 1994, ...

The bifolium is a folium with b=0. The bifolium is a quartic curve and is given by the implicit equation is (x^2+y^2)^2=4axy^2 (1) and the polar equation ...

A Bill picture is a sequence of nested regular polygons in which subsequent polygons are each rotated so that they begin one vertex further. The term was coined by Trott ...

Bit rate (i.e., bits per second, abbreviated bps) is a measure of the number of data bits (digital 0s and 1s) transmitted each second in a digital communications channel. If ...

A bitwin chain of length one consists of two pairs of twin primes with the property that they are related by being of the form: (n-1,n+1) and (2n-1,2n+1). (1) The first few ...

The term Bol loop refers to either of two classes of algebraic loops satisfying the so-called Bol identities. In particular, a left Bol loop is an algebraic loop L which, for ...

A pair of vertices (x,y) of a graph G is called an omega-critical pair if omega(G+xy)>omega(G), where G+xy denotes the graph obtained by adding the edge xy to G and omega(H) ...

Let P(E_i) be the probability that E_i is true, and P( union _(i=1)^nE_i) be the probability that at least one of E_1, E_2, ..., E_n is true. Then "the" Bonferroni ...

A magic square that remains magic when its border is removed. A nested magic square remains magic after the border is successively removed one ring at a time. An example of a ...

The term Borel hierarchy is used to describe a collection of subsets of R defined inductively as follows: Level one consists of all open and closed subsets of R, and upon ...