Math, asked by samyusuresh2910, 4 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

Social Sciences, 2 months ago

What is Indian secularism and its objectives? Mention any two ways in which it prevents its objectives..

Math, 2 months ago

Describe the following sets by using specified Method. B={different digits of (101)raised to the power 3} Tabular Form Set Builder Form Cardinal Number...

Math, 2 months ago

1 5. If x+ 1/X =12, find the value of x2 +1/×2...

Social Sciences, 4 months ago

state the effects of globlization...

Hindi, 4 months ago

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

Geography, 11 months ago

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

Math, 11 months ago

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

English, 11 months ago

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