What people are saying - Write a review
We haven't found any reviews in the usual places.
Digraphs and Structures
Joining and Reaching
15 other sections not shown
Other editions - View all
1-basis 2-joined 3-between 3-connected acyclic digraph adjacency matrix balanced block chapter closed sequence complete order complete path concept condensation connectedness consists contains Corollary corresponding cut point cycle of length cyclic triples digraph of Figure digraph theory disconnected distance matrix empirical entry exactly example fundamental set geodesic Hence illustrate Implies incentral inradius integer isograph level assignment line basis line uv line vtvj line vulnerability minimum number mutually reachable number of lines number of points obtained ordered pairs outdegree pair of points path from vt point basis point vt probability vector properties prove r-points reachability matrix relation result rumor semicycle semipath joining set of lines set of points shown in Figure signed digraph strictly unilateral strictly weak strong component strong digraph structure subgraph subset symmetric digraph Theorem tournament transitive transitive closure transmitter unilateral digraph unique vt and v2 vt to vj vtv2 weak component weak digraph weakening points