2 2 votes Algorithms ace-test-series algorithms graph-algorithms + – smsubham 576 views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply Ashwin Kulkarni commented Jan 6, 2018 reply Follow flag Is it option B ? k edges? 0 0 replyShare akshat sharma commented Jan 7, 2018 reply Follow flag 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 0 replyShare Please log in or register to add a comment.
