Computer Science, asked by rahulsid55, 1 month ago

i)
The number of edges in a complete graph with 'n'
vertices is
a)
n(n-1)
b) n(n-1)/2
c)
n2
d) 2n-1.

Answers

Answered by AmanRatan

Answer:

Construct a right angled triangle whose base is 6 cm and height is 3cm then draw another triangle whose sides are 1 3/4 times the corresponding sides of the right angled triangle

Explanation:

Previous Question

Next Question

Similar questions

English, 20 days ago

your scientist friend who lives in Germany is an expert in water conservation. write a letter to him/her asking suggestions to save the rivers in nagaland.

Hindi, 20 days ago

(छ) 'मेरे पास एक किताब है जो बहुत रुचिकर है।' सरल वाक्य है (i) मेरे पास एक किताब है और वह रुचिकर है। (ii) एक रुचिकर किताब है जो मेरे पास है। L(iii) मेरे पास एक रुचिकर किताब है। (iv) मेरे पास एक रुचिकर किताब जिसे लोग पढ़ते हैं।...

Science, 20 days ago

7.Electrolysisiscarriedoutinanapparatuscalled_____. 8.____isthevisiblewhitepartoftheeyefilledwithwatery fluid.

Math, 1 month ago

72-(-18)×72 And unnecessary answer will be reported ...

English, 1 month ago

II. Combine the followings? wa 5 propre conjunction 1)That was the woman. I spoke about the job. 2)This is the house. They live opposite a big park.

English, 8 months ago

The herd of elephants found planty of food in the forest in these sentence chang in to negative sentence...

India Languages, 8 months ago

உயிறெடுத்து நீண்டு ஒலிப்பதை எனப...

Math, 8 months ago

A is twice of B . 5 years ago his age was 3 times B's age find their present age...

i)The number of edges in a complete graph with 'n'vertices isa)n(n-1)b) n(n-1)/2c)n2d) 2n-1.​

Answers

i)
The number of edges in a complete graph with 'n'
vertices is
a)
n(n-1)
b) n(n-1)/2
c)
n2
d) 2n-1.