The map . On the left, a generic initial graph G with three initial nodes (red) and a generic weighted edge . On the right, the new graph is obtained as follows and let us denote by for i = 1, 2, 3, the node in Gi image of initial node (j = 1, 2, 3). is obtained through amalgamating three copies and G by merging, respectively, three pairs of and (j = 1, 2, 3) into a single new node, which is then the initial nodes of (red).
is regarded as merging (i = 1, 2, 3).
is regarded as merging (red), (blue), and (black) (i = 1, 2, 3).
Average receiving time versus t on a semilogarithmic scale.
The average weighted shortest path.
Article metrics loading...
Full text loading...