Search Results for ""

The Dejter graph is a weakly regular graph on 112 vertices and 336 edges with regular paremeters (nu,k,lambda,mu)=(112,6,0,(0,1,2)). It can be obtained by deleting a copy of ...

A deltahedron is a polyhedron whose faces are congruent equilateral triangles (Wells 1986, p. 73). Note that polyhedra whose faces could be triangulated so as to be composed ...

The deltoidal hexecontahedron is the 60-faced dual polyhedron of the small rhombicosidodecahedron A_5. It is sometimes also called the trapezoidal hexecontahedron (Holden ...

The deltoidal icositetrahedron is the 24-faced dual polyhedron of the small rhombicuboctahedron A_6 and Wenninger dual W_(13). It is also called the trapezoidal ...

A demiregular tessellation, also called a polymorph tessellation, is a type of tessellation whose definition is somewhat problematical. Some authors define them as orderly ...

The initially palindromic numbers 1, 121, 12321, 1234321, 123454321, ... (OEIS A002477). For the first through ninth terms, the sequence is given by the generating function ...

If the three straight lines joining the corresponding vertices of two triangles ABC and A^'B^'C^' all meet in a point (the perspector), then the three intersections of pairs ...

A special case of Apollonius' problem requiring the determination of a circle touching three mutually tangent circles (also called the kissing circles problem). There are two ...

A method of determining the maximum number of positive and negative real roots of a polynomial. For positive roots, start with the sign of the coefficient of the lowest (or ...

The detour matrix Delta, sometimes also called the maximum path matrix or maximal topological distances matrix, of a graph is a symmetric matrix whose (i,j)th entry is the ...