Fig. 3From: Classes of tree-based networksNetwork Nu on labelset X = {1,2,3,4} and the simple graph resulting from the leaf shrinking procedure. At first, leaves 1, 2, 3, and 4 are deleted, resulting in a graph with one new leaf without label, which is subsequently removed. Afterwards, all resulting degree-2 vertices are suppressedBack to article page