Search Results for ""

A node in a graph for which the graph eccentricity equals the graph diameter (Harary 1994, p. 41).

The integer sequence defined by the recurrence P(n)=P(n-2)+P(n-3) (1) with the initial conditions P(0)=3, P(1)=0, P(2)=2. This recurrence relation is the same as that for the ...

The line joining the three collinear points of intersection of the extensions of corresponding sides in perspective triangles, also called the perspectrix or homology axis.

Let f(z) be an analytic function in an angular domain W:|argz|<alphapi/2. Suppose there is a constant M such that for each epsilon>0, each finite boundary point has a ...

The 4-polyhex illustrated above.

The symbol +/- is used to denote a quantity which should be both added and subtracted, as in a+/-b. The symbol can be used to denote a range of uncertainty, or to denote a ...

A knot equivalent to a polygon in R^3, also called a tame knot. For a polygonal knot K, there exists a plane such that the orthogonal projection pi on it satisfies the ...

An n-polyhedral graph (sometimes called a c-net) is a 3-connected simple planar graph on n nodes. Every convex polyhedron can be represented in the plane or on the surface of ...

The l^infty-polynomial norm defined for a polynomial P=a_kx^k+...+a_1x+a_0 by ||P||_infty=max_(k)|a_k|. Note that some authors (especially in the area of Diophantine ...

Lachlan's terms for a collection of n points.