Recall: The Handshaking Theorem: Let G = (V,E) be an undirected graph with e edges. Then 2e = > deg(v) VEV 1. How many edges are there in an undirected graph with 10 vertices each of degree 4? Use the...

1 and 2

Extracted text: Recall: The Handshaking Theorem: Let G = (V,E) be an undirected graph with e edges. Then 2e = > deg(v) VEV 1. How many edges are there in an undirected graph with 10 vertices each of degree 4? Use the Handshaking Theorem above to determine whether or not it is possible to draw the graphs below. 2. Draw the graph with specified properties or explain why no such graph exists. i) A Graph with 5 vertices of degrees 1,2,3,3,5.