Search Results for ""
541 - 550 of 827 for Complete QuadrilateralSearch Results
The 12-faced convex deltahedra also known as the Siamese dodecahedron, which is also Johnson solid J_(84). It is implemented in the Wolfram Language as ...
Spherical mirrors were a popular subject for M. C. Escher's lithographs, including "Still Life with a Spherical Mirror" (Bool et al. 1982, p. 261; Forty 2003, Plate 23), ...
A strongly binary tree is a rooted tree for which the root is adjacent to either zero or two vertices, and all non-root vertices are adjacent to either one or three vertices ...
A curve investigated by Talbot which is the ellipse negative pedal curve with respect to the ellipse's center for ellipses with eccentricity e^2>1/2 (Lockwood 1967, p. 157). ...
The tangram is a combination of plane polygonal pieces such that the edges of the polygons are coincident. There are 13 convex tangrams (where a "convex tangram" is a set of ...
Let m_1, m_2, ..., m_n be distinct primitive elements of a two-dimensional lattice M such that det(m_i,m_(i+1))>0 for i=1, ..., n-1. Each collection Gamma={m_1,m_2,...,m_n} ...
Every planar graph (i.e., graph with graph genus 0) has an embedding on a torus. In contrast, toroidal graphs are embeddable on the torus, but not in the plane, i.e., they ...
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 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-replaced graph T(G) is a cubic graph in which each vertex is replaced by a triangle graph such that each vertex of the triangle is connected to one of the ...
...
View search results from all Wolfram sites (9029 matches)

