Fig. 16From: Classes of tree-based networksCatalog of all simple and biconnected SP graphs on n ≤ 6 vertices (diamond vertices represent one possible pair of terminals, respectively) and a valid spanning tree (depicted in bold)Back to article page