Find the no of threes of n vertices without using cayleys
Answers
Answered by
1
Step-by-step explanation:
Hey dear ❤
Answer....
Total number of Spanning Trees in a Graph. If a graph is a complete graph with n vertices, then total number of spanning trees is n(n-2) where n is the number of nodes in the graph.
In complete graph, the task is equal to counting different labeled trees with n nodes for which have Cayley's formula.
❤✌Hope it will be help ful for u..❤✌
Similar questions