Math, asked by samyusuresh2910, 2 months ago

simple graph with n vertices must be connected if it has more than

Answers

Answered by rahulyd624

0

Answer:

A simple graph G with n vertices is connected if it has more than (n − 1)(n − 2)/2 edges.

Previous Question

Next Question

Similar questions

Hindi, 1 month ago

5. हिंदी वर्णमाला का कौन-सा वर्ण है जिसका प्रयोग विविध रूपों में होता है? (क)त (ख) र (ग) प (घ) च...

Physics, 1 month ago

3. Which of the following is true for displacement? (a) It cannot be zero. (b) Its magnitude is greater than the distance travelled by the object.

English, 1 month ago

fill in the blanks- she gave the police a full account _____ the attack...

Social Sciences, 2 months ago

state the effects of globlization...

Hindi, 2 months ago

धोना का bhavavaachaak संज्ञा...

Geography, 9 months ago

How are minerals useful to us how are minerals useful to us on earth...

Math, 9 months ago

Solve it ... √3+1/√3-1 = a-b √3...

English, 9 months ago

I love topaint but I don't get time to pursue my hobby find the soulition...