Search Results for ""
91 - 100 of 1423 for Small Great Circles_ 700Search Results
The great ditrigonal dodecicosidodecahedron is the uniform polyhedron with Maeder index 42 (Maeder 1997), Wenninger index 81 (Wenninger 1989), Coxeter index 54 (Coxeter et ...
2023-08-30 The great ditrigonal icosidodecahedron is the uniform polyhedron with Maeder index 47 (Maeder 1997), Wenninger index 87 (Wenninger 1989), Coxeter index 58 (Coxeter ...
The great snub icosidodecahedron is the uniform polyhedron with Maeder index 57 (Maeder 1997), Wenninger index 116 (Wenninger 1989), Coxeter index 88 (Coxeter et al. 1954), ...
Taking a connected graph or network with a high graph diameter and adding a very small number of edges randomly, the diameter tends to drop drastically. This is known as the ...
The small triakis octahedron graph is Archimedean dual graph which is the skeleton of the small triakis octahedron. It is implemented in the Wolfram Language as ...
The dual polyhedron of the small ditrigonal dodecicosidodecahedron U_(43) and Wenninger dual W_(82).
The great rhombicuboctahedral graph is the cubic Archimedean graph on 48 nodes and 72 edges that is the skeleton of the great rhombicuboctahedron as well as the great ...
The small snub icosicosidodecahedron is the uniform polyhedron with Maeder index 32 (Maeder 1997), Wenninger index 110 (Wenninger 1989), Coxeter index 41 (Coxeter et al. ...
The great truncated cuboctahedron (Maeder 1997), also called the quasitruncated cuboctahedron (Wenninger 1989, p. 145), is the uniform polyhedron with Maeder index 20 (Maeder ...
The great snub dodecicosidodecahedral graph is the skeleton of the great snub dodecicosidodecahedron, illustrated above in a few embeddings. It will be implemented in a ...
...
View search results from all Wolfram sites (21802 matches)

