← Quiz: Graph Theory: all 10 questions
Quiz: Graph Theory · Question 8 of 10
By Cayley's formula, how many spanning trees does K₄ have?
By Cayley's formula, how many spanning trees does K₄ have?
- A.4
- B.8
- C.16
- D.64
Answer & explanation
Correct answer: 16
Kₙ has nⁿ⁻² spanning trees: 4² = 16.
Can you get the rest right without peeking?
Take the timed Quiz: Graph Theory quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →