Computer Science, asked by eseshwini, 5 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

Math, 2 months ago

In the given figure, m||n. Find the marked angles ...

Science, 2 months ago

Learning Acceleration Progr 10th Class Đt: 26.02.2021 - Write the answers for the following questions in a word or phrase. Each qu 1 What is the angle of vision for healthy human being? about 60 2 Mention the minimum focal length of human eye lens. 3 What are the sub shells are present in a principle shell n = 2? @S 4 Write the short hand notation of electronic configuration. Write the answers...

Computer Science, 2 months ago

who is prime minister of India...

Math, 5 months ago

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

English, 5 months ago

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

Math, 11 months ago

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

Physics, 11 months ago

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

English, 11 months ago

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