Skip to main content
Fig. 16 | Visual Computing for Industry, Biomedicine, and Art

Fig. 16

From: Classes of tree-based networks

Fig. 16

Catalog 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