Skip to main content
Computational Social Networks
Fig. 3 | Computational Social Networks

Fig. 3

From: Clustering 1-dimensional periodic network using betweenness centrality

Fig. 3

Edge-betweenness clusters using betweenness values on static graph (left) and periodic graph (right); Each node represents a student, and the color of each node represents the class of a student corresponding to the node. The edges shown in the figures are edges that remained after we remove edges with high betweenness centrality. Each connected component in the remaining graphs represents a cluster of nodes

Back to article page