This preview shows page 1. Sign up to view the full content.
Unformatted text preview: is ni 1. Thus, the total number of edges is (nl  1) + (n2  1) + . .. + (nc 1) = n  c. 27. (a) [BB] Using Corollary 12.1.7, we have Ldeg(vi) ~ 8, so the tree has at least four edges and hence at least five vertices. If the result is not true, then there are two vertices of degree 3, at most three vertices of degree 1, and the rest have degree at least 2. Then Ldegvi ~ 2(3) + 3(1) + (n  5)2 = 2n 1, contradicting the fact that L deg Vi = 2 (n  1). (b) Here is a tree with two vertices of degree 3 and exactly four vertices of degree 1. Exercises 12.2 1. [BB] We show T and two other spanning trees found by adding a and then successively deleting f and 9 are shown to the right. 2. (a) [BB] Here is one possible answer. The second and third trees are isomorphic, but neither is isomorphic to the first. T a 4 5 a...
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