A complete undirected graph of n nodes can have maximum ______ spanning trees.
Posted: Thu Jul 14, 2022 9:05 am
a) nn+1
b) nn-2
c) \(\frac{n(n+1)}{2}\)
d) n
b) nn-2
c) \(\frac{n(n+1)}{2}\)
d) n
Accurate answers. Every time.
https://answerhappy.com/