0 0 votes Maximum number of edges in a simple graph with ' $n$ ' vertices and ' $k$ ' components is:$\dfrac{(n-2)(n-1)}{2}+1$$\dfrac{(n-k)(n-k+1)}{2}$$n^{2}$$\dfrac{(n)(n-1)}{2}$ Others cil-2017 + – Shubham Sharma 2 34 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.