Computer Science, asked by eseshwini, 4 months ago

what is maximum possible number of edges in a direct graph with no self loops having 8 vertices

Answers

Answered by Anonymous

3

Answer:

where n = number of vertices. 8(8-1) / 2 = 28. Therefore a simple graph with 8 vertices can have a maximum of 28 edges.

Explanation:

hope it helps

Previous Question

Next Question

Similar questions

Social Sciences, 2 months ago

al Badshah Masjid (b) Adina Masjid (c) Badshahi Masjid (a) Jama Masjid Give one-word answer for the following statements. Choose your answer from the help box. Fresco Trelliswork Ratha Dome Shikara Garbhagriha Mihrah 1. The innermost chamber in a temple; where the main idol is kept 2. The vimana in North Indian temples; the stone above the vimana in South Indian temples 3. A rounded vault forming...

Math, 2 months ago

Now a=4, d=4,TN= 136...

Science, 2 months ago

Which of these is not a natural habitat? (a) sea (b) desert (c)zoo (d) mountain...

Math, 4 months ago

expand (2y-1)² please answer me fast...

English, 4 months ago

There is no gain in that pain. [affirmative]...

Math, 10 months ago

Find the ratio of 115 kg to 220 g...

Physics, 10 months ago

prove that displacement vector is equal to difference of two position vector ...

English, 10 months ago

The poet Feels Satisfied and happy when he watches the shower work because...