How Many Spanning Trees Can A Graph Has?

1.	How Many Spanning Trees Can A Graph Has?
Answer» It depends on how CONNECTED the graph is. A COMPLETE UNDIRECTED graph can have maximum nn-1 number of SPANNING TREES, where n is number of nodes. It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.

Answer»

It depends on how CONNECTED the graph is. A COMPLETE UNDIRECTED graph can have maximum nn-1 number of SPANNING TREES, where n is number of nodes.

It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.

Discussion