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
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
Get step-by-step solutions from verified subject matter experts
