1.

How to find the diameter of a cayley tree in terms of number of vertex?

Answer»

\huge\bold{HEY:)-}

============

⭐⭐⭐⭐⭐⭐ ⭐ ⭐ ⭐ ⭐ ⭐ ❤❤❤⭐⭐⭐⭐ \\ \\ \\ \\ \\

We give a new PROOF of Cayley's formula, which states that the number of labeled trees on n NODES is nn−2. This proof uses a difficult combinatorial identity, and it could equally well be regarded as a proof of this identity that uses Cayley's formula. The proof proceeds by counting labeled rooted trees with n vertices and j improper edges, where an improper edge is ONE whose ENDPOINT closer to the root has a larger label than some VERTEX in the subtree rooted on the edge.⤵⤵⤵⤵

FOLLOW , BRAINLIST ME☺☺PLZZ



Discussion

No Comment Found

Related InterviewSolutions