503 views

1 Answer

Best answer
2 votes
2 votes
Maximum number of possible edges in an undirected simple graph with 100 (N) vertices and 5 (K) components is

=> $\left ( N - K \right )\left ( N - K + 1 \right ) / 2$

=> 4560
selected by
Answer:

Related questions

0 votes
0 votes
3 answers
1
Arjun asked Oct 10, 2016
619 views
Consider a complete graph of 10 vertices. The minimum no. of edge removals required to make the graph disconnected is ______
1 votes
1 votes
2 answers
2
Arjun asked Oct 10, 2016
460 views
What is the chromatic number of the following graph?
0 votes
0 votes
2 answers
3
Arjun asked Oct 10, 2016
559 views
A vertex having no incident edge is called -pendent vertex end vertexisolated vertex none of these