The number of reachable pairs in a digraph
暂无分享,去创建一个
For a digraph G, let R(G) (respectively, R^(^k^)(G)) be the number of ordered pairs (u,v) of vertices of G such that u v and v is reachable from u (respectively, reachable from u by a path of length ==k+(k+1)^0^.^5^7+2, for arbitrary k.
[1] Claude Berge. Theory of graphs and its applications , 1962 .
[2] Norman,et al. Structural Models: An Introduction to the Theory of Directed Graphs. , 1966 .
[3] Claude Berge,et al. The theory of graphs and its applications , 1962 .