Search Results for ""

A d-dimensional framework is a pair (G,p) where G=(V,E) is a graph with vertex set V and edge set E and p:V->R^d is a map that assigns a point in R^d to each vertex of G. The ...

The Hadwiger conjecture is a generalization of the four-color theorem which states that for any loopless graph G with h(G) the Hadwiger number and chi(G) the chromatic ...

Let G=(V,E) be a (not necessarily simple) undirected edge-weighted graph with nonnegative weights. A cut C of G is any nontrivial subset of V, and the weight of the cut is ...

The (interior) bisector of an angle, also called the internal angle bisector (Kimberling 1998, pp. 11-12), is the line or line segment that divides the angle into two equal ...

The Cauchy distribution, also called the Lorentzian distribution or Lorentz distribution, is a continuous distribution describing resonance behavior. It also describes the ...

Dots and boxes is a two-person game based on a rectangular lattice of points. Each player, in turn, draws a horizontal or vertical line connecting two adjacent points. ...

The osculating circle of a curve C at a given point P is the circle that has the same tangent as C at point P as well as the same curvature. Just as the tangent line is the ...

A domatic partition is a partition of the vertices of a graph into disjoint dominating sets. The maximum number of disjoint dominating sets in a domatic partition of a graph ...

An embedding is a representation of a topological object, manifold, graph, field, etc. in a certain space in such a way that its connectivity or algebraic properties are ...

The game of billiards is played on a rectangular table (known as a billiard table) upon which balls are placed. One ball (the "cue ball") is then struck with the end of a ...