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

English, 1 month ago

What did Hughie give to the beggar? What was the latter's reaction?

Math, 1 month ago

find the value of (3^2)2...

Math, 1 month ago

4 What is the distance between two parallel tangents of a circle in given figure, if AT is a tangent to the circle with centre 0. s ZOTA = 30°, then find the length of AT (in cm).

Social Sciences, 3 months ago

state the effects of globlization...

Hindi, 3 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...