Search Results for ""

The twist of a ribbon measures how much it twists around its axis and is defined as the integral of the incremental twist around the ribbon. A formula for the twist is given ...

A graph for which the relations between pairs of vertices are symmetric, so that each edge has no directional character (as opposed to a directed graph). Unless otherwise ...

An ungraceful graph is a simple graph that does not possess a graceful labeling, i.e., a graph that is not a graceful graph (Gardner 1972). Such graphs have also been termed ...

A map f from a metric space M=(M,d) to a metric space N=(N,rho) is said to be uniformly continuous if for every epsilon>0, there exists a delta>0 such that ...

An urelement contains no elements, belongs to some set, and is not identical with the empty set (Moore 1982, p. 3; Rubin 1967, p. 23). "Ur" is a German prefix which is ...

Vardi's integral is the beautiful definite integral int_(pi/4)^(pi/2)lnlntanxdx = pi/2ln[sqrt(2pi)(Gamma(3/4))/(Gamma(1/4))] (1) = pi/4ln[(4pi^3)/(Gamma^4(1/4))] (2) = ...

Although the multiplication of one vector by another is not uniquely defined (cf. scalar multiplication, which is multiplication of a vector by a scalar), several types of ...

The vertex set of a graph is simply a set of all vertices of the graph. The cardinality of the vertex set for a given graph g is known as the vertex count of g. The vertex ...

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. This partitions graphs into ...

Two polygons are congruent by dissection iff they have the same area. In particular, any polygon is congruent by dissection to a square of the same area. Laczkovich (1988) ...