Question discussion

How many different spanning trees does the complete graph K4 (4 vertices, every pair joined by an edge) have?

2383Medium DSSSB TGT Computer Science 0 replies 1 views

Correct answer: A

Explanation

By Cayley's formula the number of labelled trees on n vertices is n^(n−2) = 4² = 16.

Nobody has replied yet. Start the discussion!