Fig. 10From: Chained structure of directed graphs with applications to social and transportation networksNetwork ibm32: the chain length and lower bandwidth of the \(\{\ell ,k\}\)-chained structure determined by the out-tree (left) and the in-tree (right) rooted at each vertex \(v_j\), \(j=1,2,\ldots ,32\)Back to article page