A simple graph ( a graph without parallel edge or loops) with $n$ vertices and $k$ components can have at most
Ans D)
graph with n vertices and k component has (n-k) ≤ e ≤(n-k)(n-k+1)/2 edges
Answer D)
https://gateoverflow.in/510/gate1991_01-xv
64.3k questions
77.9k answers
244k comments
80.0k users