Total number of spanning tree of a complete graph of 4 vertices K₄ is:
2017
Total number of spanning tree of a complete graph of 4 vertices K₄ is:
Answer: B. 16 — The correct option is B. According to Cayley's Formula, the total number of spanning trees in a labeled complete graph Kn with n vertices is given by n^{n-2}.…
- A.
15
- B.
16
- C.
3
- D.
17
Attempted by 330 students.
Show answer & explanation
Correct answer: B
The correct option is B.
According to Cayley's Formula, the total number of spanning trees in a labeled complete graph Kn with n vertices is given by n^{n-2}. For a complete graph with 4 vertices (K4), the total number of spanning trees is 4^{4-2} = 4^2 = 16.
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…