Search Results for ""

A total order (or "totally ordered set," or "linearly ordered set") is a set plus a relation on the set (called a total order) that satisfies the conditions for a partial ...

A shortened term for integral transform. Geometrically, if S and T are two transformations, then the similarity transformation TST^(-1) is sometimes called the transform ...

A transposition graph G_n is a graph whose nodes correspond to permutations and edges to permutations that differ by exactly one transposition (Skiena 1990, p. 9, Clark ...

A tripod is a tree having exactly three tree leaves (Pirnazar and Ullman 2002). The numbers of tripods on n=1, 2, ... vertices are 0, 0, 0, 1, 1, 2, 3, 4, 5, 7, 8, 10, 12, ...

The truncated dodecadodecahedron, also called the quasitruncated dodecahedron, is the uniform polyhedron with Maeder index 59 (Maeder 1997), Wenninger index 98 (Wenninger ...

Let G(V,E) be a graph with graph vertices V and graph edges E on n graph vertices without a (k+1)-clique. Then t(n,k)<=((k-1)n^2)/(2k), where t(n,k) is the edge count. (Note ...

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 ...