Search Results for ""

Given the closed interval [0,x] with x>1, let one-dimensional "cars" of unit length be parked randomly on the interval. The mean number M(x) of cars which can fit (without ...

Given a simplex of unit content in Euclidean d-space, pick n>=d+1 points uniformly and independently at random, and denote the expected content of their convex hull by ...

The mean tetrahedron volume of a tetrahedron with vertices chosen at random inside another tetrahedron of unit volume is given by V^_ = (13)/(720)-(pi^2)/(15015) (1) = ...

The Walsh functions consist of trains of square pulses (with the allowed states being -1 and 1) such that transitions may only occur at fixed intervals of a unit time step, ...

The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...

Tutte (1971/72) conjectured that there are no 3-connected nonhamiltonian bicubic graphs. However, a counterexample was found by J. D. Horton in 1976 (Gropp 1990), and several ...

The score sequence of a tournament is a monotonic nondecreasing sequence of the outdegrees of the graph vertices of the corresponding tournament graph. Elements of a score ...

A tree (also called a central tree) having a single node that is a graph center. The numbers of centered trees on n=1, 2, ... nodes are 1, 0, 1, 1, 2, 3, 7, 12, 27, 55, 127, ...

An isolated point of a graph is a node of degree 0 (Hartsfield and Ringel 1990, p. 8; Harary 1994, p. 15; D'Angelo and West 2000, p. 212; West 2000, p. 22). The number of ...

The great icosahedron, not to be confused with the great icosidodecahedron orgreat icosicosidodecahedron, is the Kepler-Poinsot polyhedronhose dual is the great stellated ...