Computer Science, asked by raghu16ee039, 5 months ago

Q1 - A complete graph can have
A-n spanning trees
B-n" - 2 spanning trees
C-n"+ 1 spanning trees
D-n spanning trees​

Answers

Answered by ranibaishla
2

Answer:

4 tree graph

you must have liked my answer

Similar questions