Search Results for ""

The triangle transformation principle gives rules for transforming equations involving an incircle to equations about excircles.

A triangular grid, also called an isometric grid (Gardner 1986, pp. 209-210), is a grid formed by tiling the plane regularly with equilateral triangles.

A triangular pyramid is a pyramid having a triangular base. The tetrahedron is a triangular pyramid having congruent equilateral triangles for each of its faces. The edge ...

Let phi(x_1,...,x_m) be an L_(exp) formula, where L_(exp)=L union {e^x} and L is the language of ordered rings L={+,-,·,<,0,1}. Then there exist n>=m and f_1,...,f_s in ...

A number N=p_1p_2...p_n where the p_is are distinct primes and n>=3 such that p_i=Ap_(i-1)+B (1) for i=1, 2, ..., n, p_0 taken as 1, and with A and B some fixed integers. For ...

The Cartesian graph product G=G_1 square G_2, also called the graph box product and sometimes simply known as "the" graph product (Beineke and Wilson 2004, p. 104) and ...

A Hamiltonian path, also called a Hamilton path, is a graph path between two vertices of a graph that visits each vertex exactly once. If a Hamiltonian path exists whose ...

The n-ladder graph can be defined as L_n=P_2 square P_n, where P_n is a path graph (Hosoya and Harary 1993; Noy and Ribó 2004, Fig. 1). It is therefore equivalent to the 2×n ...

Let S be a collection of subsets of a finite set X. A subset Y of X that meets every member of S is called the vertex cover, or hitting set. A vertex cover of a graph G can ...

The regular tessellation {6,3} consisting of regular hexagons (i.e., a hexagonal grid). In general, the term honeycomb is used to refer to a tessellation in n dimensions for ...