f a graph had 16 vertices of odd valence, what is the absolute MINIMUM number of edges that would need to be added (duplicated) to eulerize the graph? 10 9. If a graph had 16 vertices of odd valence, what is the absolute MINIF 2 8 06 4 9. If a graph had 16 vertices of odd 2 8 06 4