MCQOPTIONS
Saved Bookmarks
| 1. |
A complete undirected graph of n nodes can have maximum ______ spanning trees. |
| A. | nⁿ⁺¹ |
| B. | nⁿ⁻² |
| C. | \(\frac{n(n+1)}{2}\) |
| D. | n |
| Answer» C. \(\frac{n(n+1)}{2}\) | |