Let G be a connected graph with four vertices v1, v2, v3, and v4 of odd degree. Show that there are paths with no repeated edges from v1 to v2 and from v3 to v4 such that every edge in G is in exactly one of the paths. | Numerade

Draw a simple, connected, weighted graph with 8 vertices and 16 edges, each with unique edge weights. Identify one vertex as a “start” vertex and illustrate a running of Dijkstra’s algorithm on this graph. | Numerade

(10 pts) graph with 21 edges has seven vertices of degree 1, three of degree 2, seven of degree 3 and the rest of degree 4. How many vertices does it have? Can this graph be a tree? Explain