Let 8 denote the minimum degree of any vertex of a given graph, and let A denote the maximum degree of any vertex in the graph. Suppose you know that a certain graph has seven vertices, and that 8 = 3 and Δ= 5. (a) Show that this graph must contain at least 12 edges. (b) What is the largest number of edges possible in this graph?
