Question

state and prove cayley's theorem​

Answer 1

Answer:

( n - 2 k ) Tk+1Tn−k−1; for n > 1 and T1 = 1, and then it is proved that Tn = nn−2, which gives yet another proof of the celebrated Cayley's tree formula. Cayley's tree formula is a very elegant result in Graph Theory. The problem is to find the number of all possible trees on a given set of labeled vertices.

Answer 2

♡♡♡♡♡♡♡♡♡♡♡♡

i hope it helps you

♥♥♥♥♥♥♥♥♥♥♥♥♥♥