- Thread starter
- #1

- Apr 13, 2013

- 3,718

Wo consider the graph $G$ that we get by deleting any edge from the complete bipartite graph $K_{7,8}$. How many spanning trees does the complement graph $\overline{G}$ of $G$ have?

Could you give me a hint how we can find the desired number of spanning trees?