Search Results for ""

In floating-point arithmetic, the significand is a component of a finite floating-point number containing its significant digits. Generally speaking, the significand can be ...

A small circle is a spheric section that does not contain a diameter of the sphere (Kern and Bland 1948, p. 87; Tietze 1965, p. 25).

A fundamental structural result in extremal graph theory due to Szemerédi (1978). The regularity lemma essentially says that every graph can be well-approximated by the union ...

The contraction of a tensor is obtained by setting unlike indices equal and summing according to the Einstein summation convention. Contraction reduces the tensor rank by 2. ...

A graph is said to be unswitchable if it cannot be reduced to another graph with the same degree sequence by edge-switching. Conversely, a graph that can be reduced to ...

A zero-symmetric graph is a vertex-transitive cubic graph whose edges are partitioned into three orbits by its automorphism group. The figures above show some small ...

A binary tree is a tree-like structure that is rooted and in which each vertex has at most two children and each child of a vertex is designated as its left or right child ...

A caterpillar graph, caterpillar tree, or simply "caterpillar," is a tree in which every graph vertex is on a central stalk or only one graph edge away from the stalk (in ...

A labeled graph G=(V,E) is a finite series of graph vertices V with a set of graph edges E of 2-subsets of V. Given a graph vertex set V_n={1,2,...,n}, the number of ...

An algebraic set is the locus of zeros of a collection of polynomials. For example, the circle is the set of zeros of x^2+y^2-1 and the point at (0,0) is the set of zeros of ...