Search Results for ""

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

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 Boy surface is a nonorientable surface that is one possible parametrization of the surface obtained by sewing a Möbius strip to the edge of a disk. Two other ...

In response to a letter from Goldbach, Euler considered sums of the form s_h(m,n) = sum_(k=1)^(infty)(1+1/2+...+1/k)^m(k+1)^(-n) (1) = ...

Let s_k be the number of independent vertex sets of cardinality k in a graph G. The polynomial I(x)=sum_(k=0)^(alpha(G))s_kx^k, (1) where alpha(G) is the independence number, ...

The second knot polynomial discovered. Unlike the first-discovered Alexander polynomial, the Jones polynomial can sometimes distinguish handedness (as can its more powerful ...

LCF notation is a concise and convenient notation devised by Joshua Lederberg (winner of the 1958 Nobel Prize in Physiology and Medicine) for the representation of cubic ...

Percolation, the fundamental notion at the heart of percolation theory, is a difficult idea to define precisely though it is quite easy to describe qualitatively. From the ...

An analog of the polyominoes and polyiamonds in which collections of regular hexagons are arranged with adjacent sides. They are also called hexes, hexas, or polyfrobs ...

A random-connection model (RCM) is a graph-theoretic model of continuum percolation theory characterized by the existence of a stationary point process X and a non-increasing ...