3 votes 3 votes i didn't read the concept related to strongly connected components please it describe it for this question Graph Theory zeal graph-theory discrete-mathematics graph-connectivity zeal2019 + – Prince Sindhiya asked Nov 11, 2018 • edited Mar 9, 2019 by ajaysoni1924 Prince Sindhiya 826 views answer comment Share Follow See all 13 Comments See all 13 13 Comments reply Utkarsh Joshi commented Nov 11, 2018 i edited by Utkarsh Joshi Nov 11, 2018 reply Follow Share consider a graph with 3 vertices, A, B, and C. Having directed edges as A-B and B-C. strongly connected components in a graph are three (A, B and C) Adding C-A edge will give us 1 strongly connected component (A-B-C)so statement 1 is FALSE. Not getting counterexample for statement 2 So I think B is the correct choice. 0 votes 0 votes Gurdeep Saini commented Nov 11, 2018 reply Follow Share b ?? 0 votes 0 votes Magma commented Nov 11, 2018 reply Follow Share why not C ?? they mention "atmost 1 " 0 votes 0 votes Magma commented Nov 11, 2018 reply Follow Share the number of strongly connected component decreases right ?? 0 votes 0 votes Gurdeep Saini commented Nov 11, 2018 reply Follow Share @magma lets consider a example A to B ,B to C in this graph there are total 3 strongly connected component so when we add a edge C to A than it become only 1 strongly connected component means reduce by 2 so B is answer 1 votes 1 votes Magma commented Nov 11, 2018 reply Follow Share yup correct thanks 0 votes 0 votes Magma commented Nov 11, 2018 reply Follow Share Gurdeep Saini can you please post the diagram here ?? 0 votes 0 votes Gurdeep Saini commented Nov 11, 2018 reply Follow Share reduce from 3 to 1 1 votes 1 votes Magma commented Nov 11, 2018 reply Follow Share yeah great 1 votes 1 votes Prince Sindhiya commented Dec 21, 2018 reply Follow Share @gurdeep what about 2 statement its answer is given as d) their explanation but i think they have taken wrong graph becuase in the given graph there should be three SCC and after adding an edge there will be 2 SCC please correct me if i am wrong 0 votes 0 votes Gurdeep Saini commented Dec 21, 2018 reply Follow Share 4 SCC 0 votes 0 votes Gurdeep Saini commented Dec 21, 2018 reply Follow Share and after adding edge SCC become 2 0 votes 0 votes BASANT KUMAR commented Jul 7, 2019 reply Follow Share i think option (d) is correct counter example for statement (2) is consider the graph ABCD where path can be given as $A\rightarrow B ,B\rightarrow C, C\rightarrow D ,A\rightarrow D$ now here there is zero strongly connected component but when we add an edge $C\rightarrow A$ there will be one strongly connected component i.e ABC. 0 votes 0 votes Please log in or register to add a comment.