Fig. 13
Example 11: two spanning trees (a) and (b) with maximal chain structure length. The dashed edges are added to each tree \({{\mathcal{T}}}\) to obtain the graph \(C({{\mathcal{T}}})\)
Fig. 13 | Applied Network Science
Example 11: two spanning trees (a) and (b) with maximal chain structure length. The dashed edges are added to each tree \({{\mathcal{T}}}\) to obtain the graph \(C({{\mathcal{T}}})\)