Computer Science, asked by raghu16ee039, 6 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

Previous Question

Next Question

Similar questions

Social Sciences, 3 months ago

In table tennis, where must the position of the ball rest when serving?

English, 3 months ago

what does the poet say brimming river? in the chapter of the river in 9 th class..

English, 3 months ago

2) He travelled Ticket...

Biology, 6 months ago

explain scientific method with an example?

Social Sciences, 6 months ago

organic farming don't include...

English, 1 year ago

Juanito ,give me my book Reported speech...

English, 1 year ago

Quote the lines that prove that the daffodils were the most beautiful that day for the poet in the poem daffodils...

Geography, 1 year ago

Divide 1050rs among A,B,C such that A receives as much as B and C together and B receives as much as A and C together. Find shares of A,B,C...