Figure 4From: Efficient enumeration of monocyclic chemical graphs with given path frequenciesExamples of k -augmented trees. A k-augmented tree is obtained by adding k edges to a multi-tree, where a multi-tree is a tree with multiple bonds (precisely, multiple edges between the same pair(s) of vertices).Back to article page