On the number of reachable pairs in a digraph

Eric Swartz, Nicholas J. Werner

A pair $(u,v)$ of (not necessarily distinct) vertices in a directed graph $D$ is called a reachable pair if there exists a directed path from $u$ to $v$. We define the weight of $…