Algorithms 4th edition What is the maximum number of edges in a graph with V vertices and no parallel edges?
What is the minimum number of edges in a graph with V vertices, none of which are isolated (have degree 0)?
Addendum to textbook: You must also justify your choices for this question.