Search Results for ""

The A graph is the graph on 6 vertices illustrated above. Unfortunately, at least one author (Farrugia 1999, p. 2) uses the term "A-graph" to refer to the 5-node bull graph. ...

Angle trisection is the division of an arbitrary angle into three equal angles. It was one of the three geometric problems of antiquity for which solutions using only compass ...

A general n-gonal antiprism is a polyhedron consisting of identical top and bottom n-gonal faces whose periphery is bounded by a band of 2n triangles with alternating up-down ...

The Balaban 11-cage is the unique 11-cage graph, derived via a tree excision from the 12-cage graph by Balaban (1973) and proven unique by McKay and Myrvold in 2003. It is ...

The Barnette-Bosák-Lederberg graph is a graph on 38 vertices which is the smallest known example of a planar 3-connected nonhamiltonian graph, i.e., the smallest known ...

The first (called the "Blanuša double" by Orbanić et al. 2004) and second (called the "Blanuša snark" by Orbanić et al. 2004) Blanuša snarks were the second and third snarks ...

In most modern literature, a Boolean model is a probabilistic model of continuum percolation theory characterized by the existence of a stationary point process X and a ...

The bull graph is a simple graph on 5 nodes and 5 edges whose name derives from its resemblance to a schematic illustration of a bull or ram (whose face is the triangle and ...

The Burnside problem originated with Burnside (1902), who wrote, "A still undecided point in the theory of discontinuous groups is whether the group order of a group may be ...

"The" butterfly graph is a name sometimes given to the 5-vertex graph illustrated above. This graph is also known as the "bowtie graph" (West 2000, p. 12) and is the ...