This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 3 1 0  (1) 1 3 1 1 2 1 0 1 2 = 3{3[3(5) + (3)] + [( 1)5 + (1)] + [( 1)1 + 5]} [3(5) + (3)] + [(1)1 5] {( 1)[1(1)  5] + 3(5) + (2)} = 3(24)  12  6  19 = 35. We conclude that there are 35 spanning trees. 5 (d) Here is one possible answer. The first and 'm' m d second trees are isomorphic, but neither is isomorphic to the third. 1 2 3 2 1 0 0 0 1 0 1 3 1 0 0 0 1 0 1 2 1 0 0 0 Kirchhoff's matrix is 0 0 1 3 1 0 1 0 0 0 1 3 1 1 1 0 0 0 1 3 1 0 1 0 1 1 1 4...
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