Search Results for ""

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 world problem asks for the probability that two people picked at random have at least one acquaintance in common.

Connecting the centers of touching spheres in a three-dimensional Apollonian gasket by edges given a graph known as the Apollonian network. This process is illustrated above ...

A graph or directed graph together with a function which assigns a positive real number to each edge (Harary 1994, p. 52).

A scale-free network is a connected graph or network with the property that the number of links k originating from a given node exhibits a power law distribution ...

Consider a network of n resistors R_i so that R_2 may be connected in series or parallel with R_1, R_3 may be connected in series or parallel with the network consisting of ...

The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...

A causal network is an acyclic digraph arising from an evolution of a substitution system, and representing its history. The illustration above shows a causal network ...

In a network with three graph edges at each graph vertex, the number of Hamiltonian cycles through a specified graph edge is 0 or even.

The dual polyhedron of the small dodecahemidodecahedron U_(51) and Wenninger dual W_(91). When rendered, the small icosihemidodecacron and small dodecahemidodecacron appear ...