Search Results for ""
81 - 90 of 1423 for Small Great Circles_ 700Search Results
The great rhombicosidodecahedral graph is the Archimedean graph on 120 vertices and 180 edges that is the skeleton of the great rhombicosidodecahedron as well as the uniform ...
The great retrosnub icosidodecahedron, also called the great inverted retrosnub icosidodecahedron is the uniform polyhedron with Maeder index 74 (Maeder 1997), Wenninger ...
The great truncated icosahedron, also called the truncated great icosahedron, is the uniform polyhedron with Maeder index 55 (Maeder 1997), Wenninger index 95 (Wenninger ...
The dual of the great inverted snub icosidodecahedron U_(69) and Wenninger dual W_(116).
The great truncated icosidodecahedron, also called the great quasitruncated icosidodecahedron, is the uniform polyhedron with Maeder index 68 (Maeder 1997), Wenninger index ...
The great dirhombicosidodecahedron is the uniform polyhedron with Maeder index 75 (Maeder 1997), Wenninger index 119 (Wenninger 1989), Coxeter index 82 (Coxeter et al. 1954), ...
The small world problem asks for the probability that two people picked at random have at least one acquaintance in common.
The small retrosnub icosicosidodecahedron, also called the small inverted retrosnub icosicosidodecahedron, is the uniform polyhedron with Maeder index 72 (Maeder 1997), ...
The dodecicosahedral graph is the skeleton graph of the great ditrigonal dodecicosidodecahedron, great dodecicosahedron, great icosicosidodecahedron, small ditrigonal ...
The great snub dodecicosidodecahedron is the uniform polyhedron with Maeder index 64 (Maeder 1997), Wenninger index 115 (Wenninger 1989), Coxeter index 80 (Coxeter et al. ...
...
View search results from all Wolfram sites (21802 matches)

