Search Results for ""

A leaf of an unrooted tree is a node of vertex degree 1. Note that for a rooted or planted tree, the root vertex is generally not considered a leaf node, whereas all other ...

A simplex, sometimes called a hypertetrahedron (Buekenhout and Parker 1998), is the generalization of a tetrahedral region of space to n dimensions. The boundary of a ...

The radius of a polygon's incircle or of a polyhedron's insphere, denoted r or sometimes rho (Johnson 1929). A polygon possessing an incircle is same to be inscriptable or ...

Let R(z) be a rational function R(z)=(P(z))/(Q(z)), (1) where z in C^*, C^* is the Riemann sphere C union {infty}, and P and Q are polynomials without common divisors. The ...

The plastic constant P, sometimes also called le nombre radiant, the minimal Pisot number, plastic number, plastic ratio, platin number, Siegel's number, or silver number, is ...

If two similar figures lie in the plane but do not have parallel sides (i.e., they are similar but not homothetic), there exists a center of similitude, also called a ...

A convex polyhedron can be defined algebraically as the set of solutions to a system of linear inequalities mx<=b, where m is a real s×3 matrix and b is a real s-vector. ...

Let T be a tree defined on a metric over a set of paths such that the distance between paths p and q is 1/n, where n is the number of nodes shared by p and q. Let A be a ...

Suppose a,b in N, n=ab+1, and x_1, ..., x_n is a sequence of n real numbers. Then this sequence contains a monotonic increasing (decreasing) subsequence of a+1 terms or a ...

The Goldberg graphs are a family of graphs discovered by Goldberg (1981) which are snarks for n=5, 7, 9, .... Precomputed properties of Goldberg graphs are implemented in the ...