0 votes 0 votes The Minimum number of possible edges in an undirected graph with n vertices and k components is ______ vg653 asked Dec 18, 2018 vg653 467 views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments arvin commented Dec 19, 2018 reply Follow Share yes @Deepanshu every diconnected set of vertices will be a component. 1 votes 1 votes kumar.dilip commented Dec 19, 2018 reply Follow Share As we know the maximum number of edges with n vertices and k component is $\frac{(n-k)(n-k+1)}{2}$ But we consider minimum then the answer will be zero. Because of n = k. then It will be zero.( Forming Null graph.) 0 votes 0 votes arvin commented Dec 19, 2018 reply Follow Share no, it will be 0 only when n=k.. for other cases it will be n-k.. as the number of edges will be dependent on the number of components... we cannot assume it to be null graph everytime.. 0 votes 0 votes Please log in or register to add a comment.