Random Graphs
The clustering coefficient ( Ci ) of a node i in a graph is a measure of how closely connected its neighboring nodes are to each other. If Ci = 0, it means that none of the neighbors of node i are connected to each other. If Ci = 1, it means that all of the neighbors of node i are connected to each other. Therefore, about the local clustering coefficient for a random network: I. The likelihood of a connection between two neighbors of node i is p/2. II. Ci = p = 〈k〉 / N II. The node's degree does not affect its local clustering coefficient. Which of the alternatives below is correct? a) Only I and II are correct. b) Only II and III are correct. c) Only I is correct. d) Only III is correct e) None of above Original idea by: Adivair Ramos