Search Results for ""

Take any triangle with polygon vertices A, B, and C. Pick a point A_1 on the side opposite A, and draw a line parallel to BC. Upon reaching the side AC at B_1, draw the line ...

Tietze's graph is the cubic graph on 12 nodes and 18 edges illustrated above in a number of embeddings. It is implemented in the Wolfram Language as GraphData["TietzeGraph"]. ...

In the 1980s, Samuel Yates defined a titanic prime to be a prime number of at least 1000 decimal digits. The smallest titanic prime is 10^(999)+7. As of 1990, more than 1400 ...

Togliatti (1940, 1949) showed that quintic surfaces having 31 ordinary double points exist, although he did not explicitly derive equations for such surfaces. Beauville ...

In general, a topological index, sometimes also known as a graph-theoretic index, is a numerical invariant of a chemical graph (Plavšić et al. 1993). Particular topological ...

A topological space, also called an abstract topological space, is a set X together with a collection of open subsets T that satisfies the four conditions: 1. The empty set ...

A toroidal polyhedron is a polyhedron with genus g>=1 (i.e., one having one or more holes). Examples of toroidal polyhedra include the Császár polyhedron and Szilassi ...

A traceable graph is a graph that possesses a Hamiltonian path. Hamiltonian graphs are therefore traceable, but the converse is not necessarily true. Graphs that are not ...

A transformation T (a.k.a., map, function) over a domain D takes the elements X in D to elements Y in T(D), where the range (a.k.a., image) of T is defined as ...

A transition function describes the difference in the way an object is described in two separate, overlapping coordinate charts, where the description of the same set may ...