Search Results for ""
81 - 90 of 1536 for Small-World Network Average PathSearch Results
The dodecahedron-small triambic icosahedron compound is a stellated form of a truncated icosahedron, but a different truncation than in the truncated icosahedron Archimedean ...
A polyhedron compound in which the great dodecahedron is interior to its dual small stellated dodecahedron.
R. Whorf found that there are probably several thousand stellations of the small triakis octahedron (Wenninger 1983, p. 36). In particular, the convex hulls of the great ...
The small stellated truncated dodecahedron, also called the quasitruncated small stellated dodecahedron, is the uniform polyhedron with Maeder index 58 (Maeder 1997), ...
The (connected) caveman graph is a graph arising in social network theory formed by modifying a set of isolated k-cliques (or "caves") by removing one edge from each clique ...
A graph G is a hypotraceable graph if G has no Hamiltonian path (i.e., it is not a traceable graph), but G-v has a Hamiltonian path (i.e., is a traceable graph) for every v ...
Consider the length of the diagonal of a unit square as approximated by piecewise linear steps that may only be taken in the right and up directions. Obviously, the length so ...
Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. In gossiping, every person ...
The polyhedron compound of the truncated cube and its dual, the small triakis octahedron. The compound can be constructed from a truncated cube of unit edge length by ...
A directed graph is called an arborescence if, from a given node x known as the root vertex, there is exactly one elementary path from x to every other node y.
...
View search results from all Wolfram sites (167717 matches)

