Fig. 8From: Classes of tree-based networksTwo isomorphic graphs G ̃ and G” that are constructed by either deleting leaf x or suppressing vertex uBack to article page