TOPICS
Search

Search Results for ""


571 - 580 of 830 for Convex PolyhedronSearch Results
The icosahedral graph is the Platonic graph whose nodes have the connectivity of the regular icosahedron, as well as the great dodecahedron, great icosahedron Jessen's ...
A positive-height (outward-pointing) pyramid used in augmentation. The term was introduced by B. Grünbaum.
A method of constructing uniform polyhedra.
The compound of the snub cube and its dual, the pentagonal icositetrahedron. Surprisingly, the tribonacci constant t is intimately related to the metric properties of the ...
While early soccer balls were constructed in a number of ways, a fairly stadard 32-panel ball was designed by Danish national team goalkeeer Eigil Nielsen in 1962. This was ...
A topological space X is pathwise-connected iff for every two points x,y in X, there is a continuous function f from [0,1] to X such that f(0)=x and f(1)=y. Roughly speaking, ...
A simplex, sometimes called a hypertetrahedron (Buekenhout and Parker 1998), is the generalization of a tetrahedral region of space to n dimensions. The boundary of a ...
Consider the sum (1) where the x_js are nonnegative and the denominators are positive. Shapiro (1954) asked if f_n(x_1,x_2,...,x_n)>=1/2n (2) for all n. It turns out ...
The dodecahedral graph is the Platonic graph corresponding to the connectivity of the vertices of a dodecahedron, illustrated above in four embeddings. The left embedding ...
A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through a graph that visits each node ...
1 ... 55|56|57|58|59|60|61 ... 83 Previous Next

...