A complete graph on n points consists of n points, with a
Chapter 8, Problem 8.57(choose chapter or problem)
A complete graph on n points consists of n points, with a line between each pair of points. This graph is often denoted Kn . With the points labeled 1, 2, , n, show that the number of spanning trees in Kn is nn2 for n = 3, 4, .
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