Search Results for ""

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 tree decomposition is a mapping of a graph into a related tree with desirable properties that allow it to be used to efficiently compute certain properties (e.g., ...

The 60-faced dual polyhedron of the truncated dodecahedron A_(10) (Holden 1971, p. 55) and Wenninger dual W_(10). Wenninger (1989, p. 46) calls the small triambic icosahedron ...

A brute-force method of finding a divisor of an integer n by simply plugging in one or a set of integers and seeing if they divide n. Repeated application of trial division ...

A triangle-free graph is a graph containing no graph cycles of length three. A simple graph is triangle-free iff Tr(A^3)=0, where A is the adjacency matrix of the graph and ...

Every convex body B in the Euclidean plane with area A can be inscribed in a triangle of area at most equal to 2A (Gross 1918, Eggleston 1957). The worst possible fit ...

The triangle function is the function Lambda(x) = {0 |x|>=1; 1-|x| |x|<1 (1) = Pi(x)*Pi(x) (2) = Pi(x)*H(x+1/2)-Pi(x)*H(x-1/2), (3) where Pi(x) is the rectangle function, ...

The interior of the triangle is the set of all points inside a triangle, i.e., the set of all points in the convex hull of the triangle's vertices. The simplest way to ...

A triangular prism is a prism composed of two triangular bases and three rectangular sides. It is a pentahedron. It is implemented in the Wolfram Language as ...

Trigonometric functions of npi/11 for n an integer cannot be expressed in terms of sums, products, and finite root extractions on real rational numbers because 11 is not a ...