Skip to main content
Fig. 1 | Applied Network Science

Fig. 1

From: A centrality measure for cycles and subgraphs II

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 GT where all vertices belonging to T have been removed. The matrix AGT is the adjacency matrix of GT

Back to article page