Search Results for ""

A graph H is called a topological minor, also known as a homeomorphic subgraph, of a graph G if a graph subdivision of H is isomorphic to a subgraph of G. Every topological ...

An Eulerian path, also called an Euler chain, Euler trail, Euler walk, or "Eulerian" version of any of these variants, is a walk on the graph edges of a graph which uses each ...

Let N^* be the smallest dimension n of a hypercube such that if the lines joining all pairs of corners are two-colored for any n>=N^*, a complete graph K_4 of one color with ...

Consider a unit circle and a radiant point located at (mu,0). There are four different regimes of caustics, illustrated above. For radiant point at mu=infty, the catacaustic ...

Consider the distribution of distances l between a point picked at random in the interior of a unit cube and on a face of the cube. The probability function, illustrated ...

A special graph vertex that is designated to turn a tree into a rooted tree or a graph into a rooted graph. The root is sometimes also called "eve," or an "endpoint" (Saaty ...

1 uncia=1/(12). The word uncia was Latin for a unit equal to 1/12 of another unit called the as. The words "inch" (1/12 of a foot) and "ounce" (originally 1/12 of a pound and ...

An orthogonal projection of a cross onto a three-dimensional subspace. It is said to be normalized if the cross vectors are all of unit length.

The principal normal indicatrix of a closed space curve with nonvanishing curvature bisects the area of the unit sphere if it is embedded.

Given a point set P={x_n}_(n=0)^(N-1) in the s-dimensional unit cube [0,1)^s, the local discrepancy is defined as D(J,P)=|(number of x_n in J)/N-Vol(J)|, Vol(J) is the ...