Fig. 1
Schematic representation of the calculation of a centrality. Left : full network G, with in black the group of three vertices forming a triangle T, the centrality of which is desired. Right: graph G∖T where all vertices belonging to T have been removed. The matrix AG∖T is the adjacency matrix of G∖T
