Explanation wanted please.
1. In every symmetric connected graph there must be at least 2 nodes of equal degree.
2. In case of complete graph of n vertices there are n^(n-2) nu8mber of spanning trees.
Explanation wanted please.
1. In every symmetric connected graph there must be at least 2 nodes of equal degree.
2. In case of complete graph of n vertices there are n^(n-2) nu8mber of spanning trees.
So what are you expecting us to say about it, which the usual on-line references don't?
http://en.wikipedia.org/wiki/Graph_theory
http://mathworld.wolfram.com/Graph.html
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
