Question: If G is a simple undirected graph with 12 vertices and 3 connected components, what is the largest number of edges it might have?

If G is a simple undirected graph with 12 vertices and 3 connected components, what is the largest number of edges it might have?

Step by Step Solution

3.36 Rating (159 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

If G has 12 vertices and 3 connected components then the maximum number of edges it can have is 45 This would be a fully connected component ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Introduction to Algorithms Questions!