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.)
Chapter 23, PROBLEM SET 23.1 #16
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.)
This problem has been solved!
Do you need an answer to a question different from the above? Ask your question!
Related Book For 
PROBLEM SET 23.2:
PROBLEM SET 23.4:
PROBLEM SET 23.5:
PROBLEM SET 23.6:
PROBLEM SET 23.7:
PROBLEM SET 23.8: