TOPICS
Search

Search Results for ""


71 - 80 of 1536 for Small-World Network Average PathSearch Results
The small rhombicuboctahedral graph is a quartic graph on 24 nodes and 48 edges that corresponds to the skeleton of the small rhombicuboctahedron. It has graph diameter 5, ...
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 small ditrigonal dodecicosidodecahedron is the uniform polyhedron with Maeder index 42 (Maeder 1997), Wenninger index 82 (Wenninger 1989), Coxeter index 55 (Coxeter et ...
The small ditrigonal icosidodecahedron is the uniform polyhedron with Maeder index 30 (Maeder 1997), Weinninger index 70 (Wenninger 1971, p. 106-107), Coxeter index 39 ...
An untraceable graph is a graph that does not possess a Hamiltonian path, i.e., one that is not traceable. All disconnected graphs are therefore untraceable. Untraceable ...
The small snub icosicosidodecahedral graph is the skeleton of the small retrosnub icosicosidodecahedron and small snub icosicosidodecahedron. It is illustrated above in a ...
The small stellated dodecahedron is the Kepler-Poinsot polyhedra whose dual polyhedron is the great dodecahedron. It is also uniform polyhedron with Maeder index 34 (Maeder ...
The polyhedron compound of the small rhombicuboctahedron and its dual, the deltoidal icositetrahedron. The compound can be constructed from a small rhombicuboctahedron of ...
In general, a triakis octahedron is a non-regular icositetrahedron that can be constructed as a positive augmentation of regular octahedron. Such a solid is also known as a ...
The first strong law of small numbers (Gardner 1980, Guy 1988, 1990) states "There aren't enough small numbers to meet the many demands made of them." The second strong law ...
1 ... 5|6|7|8|9|10|11 ... 154 Previous Next

...