Search Results for ""

The house graph is a simple graph on 5 nodes and 6 edges, illustrated above in two embeddings, whose name derives from its resemblance to a schematic illustration of a house ...

A root-finding algorithm based on the iteration formula x_(n+1)=x_n-(f(x_n))/(f^'(x_n)){1+(f(x_n)f^('')(x_n))/(2[f^'(x_n)]^2)}. This method, like Newton's method, has poor ...

Let S be a set of n+1 symbols, then a Howell design H(s,2n) on symbol set S is an s×s array H such that 1. Every cell of H is either empty or contains an unordered pair of ...

Let P be a primitive polytope with eight vertices. Then there is a unimodular map that maps P to the polyhedron whose vertices are (0, 0, 0), (1, 0, 0), (0, 1, 0), (0, 0, 1), ...

A (presumably autobiographical) character in one of astrophysicist Fred Hoyle's novels opined the following. "I figure that if to be totally known and totally loved is worth ...

The central point in a wheel graph W_n. The hub has degree n-1.

A lossless data compression algorithm which uses a small number of bits to encode common characters. Huffman coding approximates the probability for each character as a power ...

Let a set of vertices A in a connected graph G be called convex if for every two vertices x,y in A, the vertex set of every (x,y) graph geodesic lies completely in A. Also ...

The necessary and sufficient condition that an algebraic curve has an algebraic involute is that the arc length is a two-valued algebraic function of the coordinates of the ...

The hundred-dollar, hundred-digits challenge problems are a set of ten problems in numerical analysis published in the January/February 2002 issue of SIAM News ...