Search Results for ""

The banner graph is the (4,1)-tadpole graph illustrated above. It could perhaps also be termed the 'P graph.' It is implemented in the Wolfram Language as ...

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 ...

A branch cut is a curve (with ends possibly open, closed, or half-open) in the complex plane across which an analytic multivalued function is discontinuous. For convenience, ...

The domino graph is the graph on 6 vertices illustrated above. It is isomorphic to the 3-ladder graph and the (2,3)-grid graph. It is implemented in the Wolfram Language as ...

The Dottie number is the name given by Kaplan (2007) to the unique real root of cosx=x (namely, the unique real fixed point of the cosine function), which is 0.739085... ...

A group G is a finite or infinite set of elements together with a binary operation (called the group operation) that together satisfy the four fundamental properties of ...

The hemicubical graph is the skeleton of the hemicube. It has 7 vertices, 11 edges, and 6 faces. It is implemented in the Wolfram Language as GraphData["HemicubicalGraph"].

In a 1847 talk to the Académie des Sciences in Paris, Gabriel Lamé (1795-1870) claimed to have proven Fermat's last theorem. However, Joseph Liouville immediately pointed out ...

The Lemke graph is the 8-node graph with 13 edges illustrated above (Lemke and Kleitman 1989, Hurlbert 2011, Hurlbert 2013). The Lemke graph is the smallest graph that does ...

The McGee graph is a cubic symmetric graph on 24 nodes and 36 edges which is the unique 7-cage graph. It can be constructed as the union of the two leftmost subgraphs ...