Fig. 6From: Chained structure of directed graphs with applications to social and transportation networksThe directed graphs \(C({{\mathcal {T}}}_\text {out}^1)\) and \(C({{\mathcal {T}}}_\text {in}^3)\) corresponding to the directed spanning trees in Fig. 5. The edges in \({{\mathcal {D}}}={{\mathcal {E}}}\setminus {{\mathcal {E}}}'\) added to the trees are drawn in redBack to article page