Let gjk be the number of shortest path between node j to node k and gjk{ni) be the number of shortest paths between nodes j k via node i. The betweenness centrality Ct,(rii) is calculated using Eq. ( Therefore, we used the number of nodes and links causing phase lag for the second approach. Figure 11 shows the types of node and link which need to be counted for the base tree metric.