Search Results for ""
8721 - 8730 of 9369 for Fermat 4n Plus 1 TheoremSearch Results
A golden rhombohedron is a rhombohedron whose faces consist of congruent golden rhombi. Golden rhombohedra are therefore special cases of a trigonal trapezohedron as well as ...
Successive points dividing a golden rectangle into squares lie on a logarithmic spiral (Wells 1991, p. 39; Livio 2002, p. 119) which is sometimes known as the golden spiral. ...
Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...
There exists no known P algorithm for graph isomorphism testing, although the problem has also not been shown to be NP-complete. In fact, the problem of identifying ...
The square of a graph is defined as its second graph power. The square of any biconnected graph is Hamiltonian (Fleischner 1974, Skiena 1990, p. 231). Mukhopadhyay (1967) has ...
Suppose that G is a pseudograph, E is the edge set of G, and C is the family of edge sets of graph cycles of G. Then C obeys the axioms for the circuits of a matroid, and ...
The great inverted snub icosidodecahedron is the uniform polyhedron with Maeder index 69 (Maeder 1997), Wenninger index 113 (Wenninger 1989), Coxeter index 73 (Coxeter et al. ...
The great retrosnub icosidodecahedron, also called the great inverted retrosnub icosidodecahedron is the uniform polyhedron with Maeder index 74 (Maeder 1997), Wenninger ...
The great rhombidodecahedron is the uniform polyhedron with Maeder index 73 (Maeder 1997), Wenninger index 109 (Wenninger 1989), Coxeter index 89 (Coxeter et al. 1954), and ...
Given two groups G and H, there are several ways to form a new group. The simplest is the direct product, denoted G×H. As a set, the group direct product is the Cartesian ...
...
View search results from all Wolfram sites (505142 matches)

