Search Results for ""

The truncated triangular prism is an undecagon obtained by truncation of a triangular prism. It has 18 vertices, 27 edges, and 11 faces. As a canonical polyhedron with unit ...

Truncation is the removal of portions of solids falling outside a set of symmetrically placed planes. The operation implemented as Truncate[polyhedron, r] in the Wolfram ...

A truth table is a two-dimensional array with n+1 columns. The first n columns correspond to the possible values of n inputs, and the last column to the operation being ...

A tube of radius r of a set gamma is the set of points at a distance r from gamma. In particular, if gamma(t) is a regular space curve whose curvature does not vanish, then ...

A Tucker hexagon is a hexagon inscribed in a reference triangle that has sides which are alternately parallel and antiparallel to the corresponding sides of the triangle. ...

J. Tupper concocted the amazing formula 1/2<|_mod(|_y/(17)_|2^(-17|_x_|-mod(|_y_|,17)),2)_|, where |_x_| is the floor function and mod(b,m) is the mod function, which, when ...

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 Tusi couple is a 2-cusped hypocycloid obtained by rolling a circle of radius a inside a circle of radius 2a. The result is a line segment (Steinhaus 1999, p. 145; Kanas ...

Let G be a graph and S a subgraph of G. Let the number of odd components in G-S be denoted S^', and |S| the number of graph vertices of S. The condition |S|>=S^' for every ...

Tutte's wheel theorem states that every polyhedral graph can be derived from a wheel graph via repeated graph contraction and edge splitting. For example, the figure above ...