Unformatted text preview: IZ1 B 8 5 8 5 (v) (vi) A NrO: 1 2 3 B (b) No. The graph on the left contains two vertices of degree 3 while the one on the right has just one vertex of degree 2': 3. (d) No. In the graph on the right, every two triangles share a vertex. v 16. (a) [BD] ~ o g" {e} g" {u} (c) u u (d)H 1> I ~ g" {e} 17. (a) [BB] Degree ofvl is 1; degree ofv2 is 3; degree ofv3 is 4; degree ofv4 is 2. (b) [BB] No. The maximum degree of a vertex in a graph with four vertices is 3. (Loops are not allowed in graphs.)...
View
Full
Document
This note was uploaded on 11/08/2010 for the course MATH discrete m taught by Professor Any during the Summer '10 term at FSU.
 Summer '10
 any
 Graph Theory

Click to edit the document details