For n ¥ 1, let tn count the number of spanning trees for the fan on n + 1 vertices.

Question:

For n ‰¥ 1, let tn count the number of spanning trees for the fan on n + 1 vertices. The fan for n = 4 is shown in Fig. 12.53.
1 2 3 4

(a) Show that tn+1 = tn + ˆ‘nl=0 tl, where n ‰¥ 1 and t0 = 1.
(b) For n ‰¥ 2, show that tn+1 = 3tn - tn-1.
(c) Solve the recurrence relation in part (b) and show that for n ‰¥ 1, tn = F2n, the 2nth Fibonacci number.

This problem has been solved!


Do you need an answer to a question different from the above? Ask your question!

Step by Step Answer:

View Solution
Create a free account to access the answer
Cannot find your solution?
Post a FREE question now and get an answer within minutes. * Average response time.
Question Posted: June 21, 2016 08:56:27