Search Results for ""

A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...

The Harborth graph is the smallest known 4-regular matchstick graph. It is therefore both planar and unit-distance. It has 104 edges and 52 vertices. This graph was named ...

The Hoffman graph is the bipartite graph on 16 nodes and 32 edges illustrated above that is cospectral to the tesseract graph Q_4 (Hoffman 1963, van Dam and Haemers 2003). ...

In general, an icosidodecahedron is a 32-faced polyhedron. A number of such solids are illustrated above. "The" (quasiregular) icosidodecahedron is the 32-faced Archimedean ...

The incenter I is the center of the incircle for a polygon or insphere for a polyhedron (when they exist). The corresponding radius of the incircle or insphere is known as ...

The inverse cotangent is the multivalued function cot^(-1)z (Zwillinger 1995, p. 465), also denoted arccotz (Abramowitz and Stegun 1972, p. 79; Harris and Stocker 1998, p. ...

The inverse trigonometric functions are the inverse functions of the trigonometric functions, written cos^(-1)z, cot^(-1)z, csc^(-1)z, sec^(-1)z, sin^(-1)z, and tan^(-1)z. ...

In a 1847 talk to the Académie des Sciences in Paris, Gabriel Lamé (1795-1870) claimed to have proven Fermat's last theorem. However, Joseph Liouville immediately pointed out ...

The Kepler-Poinsot polyhedra are four regular polyhedra which, unlike the Platonic solids, contain intersecting facial planes. In addition, two of the four Kepler-Poinsot ...

The Klein graph is a weakly regular graph that is the dual graph of the cubic symmetric graph F_(056)B. The Klein graph is illustrated above in four order-4 LCF notations. ...