Consider the following graph. V5 (V3 V4 V2 eg V6 V1 Compute the degree of each vertex. V1 V2 V3 4 V5 V6 Compute the total degree of the graph. Does the number of edges equal one-half the total degree of the graph? edges, the number of edges --Select-- v equal one-half the total degree of the graph. Since the graph has

G14. Draw two 'different' graphs with five vertices and degrees {1, 2, 2, 2, 3}.

. Sketch the complete graph with number of vertex 6.

In a high school class, there are students of different talents (ex. music, art, debate, sports, etc.). A committee needs to be formed consisting of the maximum number of students such that the committee is diverse – no two students with the same talent are in the committee. Transform this problem to a graph theoretic problem. What are the vertices of the graph? What are the edges of the graph? What do you have to find in the graph?