Computer Science, asked by karthikbattula143, 30 days ago

John has a complete graph. He wants to convert that complete graph in the
Minimum spanning tree by removing some edges.
How many maximum edges will he remove from the complete graph to make it a
Minimum spanning tree?
E -> no. of edges
N -> no. of nodes

Answers

Answered by rajarathnamghanta123

0

Answer:

b

Explanation:

Previous Question

Next Question

Similar questions

Social Sciences, 14 days ago

Find the miss one Ed BG rq...

English, 14 days ago

I sad to him,"I must go home."...

English, 14 days ago

They have been waiting for four hours introgative...

Math, 30 days ago

verify the following statement and also name the property 2/3 × ( 4/5 + 7/8 ) = ( 2/3 × 4/5 ) + ( 2/3 × 7/8 )...

Social Sciences, 30 days ago

make a list of things that you see in your home classify them into natural and human made resources. then classify the natural resources on the basis of their origin, development , renewability and distribution. also trace the natural source from which human made things are made. please don't spam ...

Social Sciences, 8 months ago

write a short note about ladakh...

Chemistry, 8 months ago

(a) The mass of the beaker containing sugar solution is 50 g. The mass of the beaker is 20 g. What is the mass of the sugar solution? (Hint: Sugar solution = Sugar + Water) (b) The mass of the beaker containing sugar solution (50 g) is evaporated to dryness to get crystals. How will you find out the mass of the sugar crystals?

Math, 8 months ago

1) cos 1° + cos 2° + cos 3° +...+cos 179°=...