If a graph has 20 vertices with odd degree (valence), what is the smallest number of edges that would need be duplicated to eulerize the graph?
Submit
Try a similar question
License
[more..]
Enter your answer as an integer or decimal number. Examples: 3, -4, 5.5172
Enter DNE for Does Not Exist, oo for Infinity