Homework Clinic
Mathematics Clinic => Other Maths => Topic started by: geodog55 on May 5, 2020
-
A city crew must paint the median divider along each of the 47 streets in the neighborhood shown below (starting and ending at A). The foreman wants to organize the route in the most efficient possible way.
The number of vertices of odd degree in the graph that models this problem is
◦ 16.
◦ 18.
◦ 14.
◦ 20.
◦ none of these
-
18.
-
thank you
-
thank you
-
Thank you
-
thank you