Search Results for ""

The Steiner tree of some subset of the vertices of a graph G is a minimum-weight connected subgraph of G that includes all the vertices. It is always a tree. Steiner trees ...

Let X be a set of v>=3 elements together with a set B of 3-subset (triples) of X such that every 2-subset of X occurs in exactly one triple of B. Then B is called a Steiner ...

Let the stick number s(K) of a knot K be the least number of straight sticks needed to make a knot K. The smallest stick number of any knot is s(T)=6, where T is the trefoil ...

The stomachion is a 14-piece dissection puzzle similar to tangrams. It is described in fragmentary manuscripts attributed to Archimedes as noted by Magnus Ausonius (310-395 ...

An attracting set that has zero measure in the embedding phase space and has fractal dimension. Trajectories within a strange attractor appear to skip around randomly. A ...

A string figure is any pattern produced when a looped string is spanned between two hands and is twisted and woven in various manners around the fingers and the wrists. The ...

The theorem, originally conjectured by Berge (1960, 1961), that a graph is perfect iff neither the graph nor its graph complement contains an odd graph cycle of length at ...

Given a function f(x)=f_0(x), write f_1=f^'(x) and define the Sturm functions by f_n(x)=-{f_(n-2)(x)-f_(n-1)(x)[(f_(n-2)(x))/(f_(n-1)(x))]}, (1) where [P(x)/Q(x)] is a ...

The tangent plane to a surface at a point p is the tangent space at p (after translating to the origin). The elements of the tangent space are called tangent vectors, and ...

The successive overrelaxation method (SOR) is a method of solving a linear system of equations Ax=b derived by extrapolating the Gauss-Seidel method. This extrapolation takes ...