Search Results for ""

The points of intersection of the adjacent angle trisectors of the angles of any triangle DeltaABC are the polygon vertices of an equilateral triangle DeltaDEF known as the ...

The orchard-planting problem (also known as the orchard problem or tree-planting problem) asks that n trees be planted so that there will be r(n,k) straight rows with k trees ...

The rhombic dodecahedral graph is the Archimedean dual graph which is the skeleton of the rhombic dodecahedron (as well as the Bilinski dodecahedron). It is the Levi graph of ...

The (first) rhombic dodecahedron is the dual polyhedron of the cuboctahedron A_1 (Holden 1971, p. 55) and Wenninger dual W_(11). Its sometimes also called the rhomboidal ...

A Riemann surface is a surface-like configuration that covers the complex plane with several, and in general infinitely many, "sheets." These sheets can have very complicated ...

The word "rigid" has two different meaning when applied to a graph. Firstly, a rigid graph may refer to a graph having a graph automorphism group containing a single element. ...

A figurate number of the form P_n^((4))=1/6n(n+1)(2n+1), (1) corresponding to a configuration of points which form a square pyramid, is called a square pyramidal number (or ...

There are (at least) three different types of points known as Steiner points. The point S of concurrence of the three lines drawn through the vertices of a triangle parallel ...

"The" Sylvester graph is a quintic graph on 36 nodes and 90 edges that is the unique distance-regular graph with intersection array {5,4,2;1,1,4} (Brouwer et al. 1989, ...

The truncated icosahedron is the 32-faced Archimedean solid with 60 vertices corresponding to the facial arrangement 20{6}+12{5}. It is also the uniform polyhedron with ...