ISRO Computer Science (CSE) 2015 - Question 41

All ISRO Computer Science (CSE) papers | ISRO Computer Science (CSE) 2015

The number of spanning trees for a complete graph with seven vertices is

  • A. 2^5
  • B. 7^5
  • C. 3^5
  • D. 2^2^5

Answer: B. 7^5

Explanation: Cayley's formula: n^(n-2) = 7^(7-2) = 7^5.

| | All questions of ISRO Computer Science (CSE) 2015