
242
Complex Networks: An Algorithmic Perspective
Exercises
1. Show the triadic closure relationships that may be formed in future in the ex-
ample social network of Figure 11.12
2. Show whether the labeled K
4
graph in Fig 11.13 is balanced or not by checking
each triangle and also by using the balance theorem. What is the cutset between
the two stable groups in this graph?
3. For the example graph of Fig 11.14, work out the edge betweenness values for
all edges. Then, divide this graph into three clusters using the Girvan-Newman
edge betweenness algorithm.
Figure 11.12: Example graph for Ex. 1
Figure 11.13: Example graph for Ex. ...