2,111 views

1 Answer

Best answer
6 votes
6 votes
Option a is right answer

In a complete graph each vertex is associated with all other vertes . They dont have self loop

So in Complete graph of n vertices

each vertex has a degree of n-1

Therfore n vertex will have n (n-1) degree....1

And we know that sum of degree of vertex = 2*edges

n*(n-1) = 2*e

e = n(n-1)/2
selected by
Answer:

Related questions

5 votes
5 votes
2 answers
2
3 votes
3 votes
1 answer
3
makhdoom ghaya asked Jun 5, 2016
6,285 views
The built-in base class in java, which is used to handle all exceptions isRaiseExceptionErrorThrowable
1 votes
1 votes
1 answer
4
makhdoom ghaya asked Jun 5, 2016
7,805 views
Which of the following is not provided as a service in cloud computing?Infrastructure as a serviceArchitecture as a serviceSoftware as a servicePlatform as a service