If a Graph Had Eight Vertices of Odd Valence, What

question 63

Multiple Choice

If a graph had eight vertices of odd valence, what is the absolute minimum number of edges that would need to be duplicated to eulerize the graph?

• A) 2
• B) 4
• C) 6
• D) 8