Question: Show that a graph G with n vertices can have at most n(n - 1)/2 edges, and G has exactly n(n - 1)/2 edges if

Show that a graph G with n vertices can have at most n(n - 1)/2 edges, and G has exactly n(n - 1)/2 edges if G is complete, that is, if every pair of vertices of G is joined by an edge. (Recall that loops and multiple edges are excluded.)

Step by Step Solution

3.55 Rating (159 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Join v 1 to v 2 v n then v 2 to ... 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 Advanced Engineering Mathematics Questions!