Cayleys theorem. Cayleys theorem says that the number of spanning trees in a complete
Chapter 7, Problem 53(choose chapter or problem)
Cayleys theorem. Cayleys theorem says that the number of spanning trees in a complete graph with N vertices is given by NN-2 . (a) List the 42 = 16 spanning trees of K4. (b) Which is larger, the number of Hamilton circuits or the number of spanning trees in a complete graph with N vertices? Explain.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer