Search Results for ""

An automorphism which interchanges the two vertices of a regular map at each edge without interchanging the vertices.

The Reuleaux tetrahedron, sometimes also called the spherical tetrahedron, is the three-dimensional solid common to four spheres of equal radius placed so that the center of ...

The rhombic hexecontahedron is a 60-faced polyhedron that can be obtained by stellating the rhombic triacontahedron by placing a plane along each edge which is perpendicular ...

A beautiful class of polyhedra composed of rhombic faces discovered accidentally by R. Towle while attempting to develop a function to create a rhombic hexahedron from a ...

The m×n rook complement graph K_m square K_n^_ is the graph complement of the m×n rook graph. It has vertex count mn and edge count 2(m; 2)(n; 2), where (n; k) is a binomial ...

An analytic function f on the unit disk is called schlicht if 1. f is one-to-one, 2. f(0)=0, and 3. f^'(0)=1, in which case it is written f in S. Schlicht functions have ...

A shuffle-exchange graph is a nonsimple graph (due to the existence of graph loops) whose vertices are length n binary strings with an edge from w to w^' if 1. w^' differs ...

The polyhedron compound of the icosahedron (U_(22)) and the great dodecahedron (U_(35)), sometimes known as the small cid. Four faces meet at each edge of the small complex ...

The line segment connecting opposite polyhedron vertices (i.e., two polyhedron vertices which do not share a common face) in a parallelepiped or other similar solid. Also ...

Johnson solid J_(86).