• Graph Cohesion

Graph Cohesion

The minimal number of nodes to be removed, to get a resulting graph which is not strongly connected. That means, two nodes exist, which are not connected by a path.