Unformatted text preview: N=4,6,8,10) and see if a pattern emerges. You do not need to determine the exact relationship between the diameter and the number of nodes, only the functional form of the dependence (i.e. is it logarithmic, linear, exponential etc.). This relationship is called scaling, and is used in sentences as “the maximum distance scales logarithmically with the number of nodes”. (b) On the ring lattice from above every pair of nodes at distance two on the ring is connected by an edge. What is the clustering coeFcient of the nodes? Does it depend on N? Extra credit question: Construct a square lattice (grid) L edges long and L edges wide. How does the maximum distance between nodes depend on L? Tip: again, focus on the scaling relationship. 1...
View
Full Document
 Fall '09
 Graph Theory, Work, maximum distance

Click to edit the document details