Figure 2From: Efficient enumeration of monocyclic chemical graphs with given path frequenciesExample of a Σ - colored multi-graph G and its feature vector f 1 ( G ). G represents a hydrogen-suppressed chemical graph, where deg(v;G)<val(c(v)) holds for some vertex v∈V(G). Since each path is counted for both directions, the entry for C2C is not one, but two.Back to article page