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 851 views answer comment Share Follow See all 13 Comments See all 13 13 Comments reply Show 10 previous comments 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.