Search Results for ""

The Nechushtan graph, illustrated above, is a 10-vertex 5-chromatic graph that is unit-distance in 3 dimensions. It was used by Nechushtan (2002) in the construction of of a ...

The Nørlund polynomial (note that the spelling Nörlund also appears in various publications) is a name given by Carlitz (1960) and Adelberg (1997) to the polynomial ...

A golden rhombohedron is a trigonal trapezohedron (and therefore rhombohedron with congruent rhombic faces) whose faces consist of six equal golden rhombi. There are two ...

The octahemioctahedron, also called the octatetrahedron, is the uniform polyhedron with Maeder index 3 (Maeder 1997), Wenninger index 68 (Wenninger 1989), Coxeter index 37 ...

Ono (1914) conjectured that the inequality 27(b^2+c^2-a^2)^2(a^2+c^2-b^2)^2(a^2+b^2-c^2)^2<=(4K)^6 holds true for all triangles, where a, b, and c are the lengths of the ...

An oriented graph is a directed graph having no symmetric pair of directed edges. A complete oriented graph is called a tournament. The numbers of oriented graphs on n=1, 2, ...

PEMDAS is an acronym used primarily in the United States as a mechanism to pedagogically enforce the order rules of computational precedence. PEMDAS is explained as follows: ...

The placement of objects so that they touch in some specified manner, often inside a container with specified properties. For example, one could consider a sphere packing, ...

A simple unlabeled graph on n vertices is called pancyclic if it contains cycles of all lengths, 3, 4, ..., n. Since a pancyclic graph must contain a cycle of length n, ...

In three dimensions, a parallelepiped is a prism whose faces are all parallelograms. Let A, B, and C be the basis vectors defining a three-dimensional parallelepiped. Then ...