2 votes 2 votes Algorithms ace-test-series algorithms graph-algorithms + – smsubham asked Jan 6, 2018 • edited Mar 6, 2019 by Rishi yadav smsubham 283 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Ashwin Kulkarni commented Jan 6, 2018 reply Follow Share Is it option B ? k edges? 0 votes 0 votes akshat sharma commented Jan 7, 2018 reply Follow Share yes we know number of edges in Graph G wih n vertices K component is (n-k)<e>(n-k+1)(n-k)/2 replace k to n-k-->>n-(n-k) =K edges 0 votes 0 votes Please log in or register to add a comment.
