1 votes 1 votes Graph Theory gate-preparation test-series made-easy-test-series self-doubt counting graph-theory discrete-mathematics graph-connectivity + – tishhaagrawal asked Dec 16, 2023 tishhaagrawal 565 views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments rexritz commented Dec 18, 2023 reply Follow Share Yes @tishhaagrawal you are right. For 5 vertices answer should be 32. 0 votes 0 votes tishhaagrawal commented Dec 18, 2023 reply Follow Share @parth023 I think you are right, we will get only 15 subgraphs if we choose 2 vertices from the given graph. But counting all the subgraphs present in the given graph using this approach will be very tedious, also we might miss some of the subgraphs in this approach! The solution provided by Made Easy is surely wrong, but can you explain a systematic way to get to the answer, please 0 votes 0 votes parth023 commented Dec 18, 2023 reply Follow Share @tishhaagrawal i’m getting 123 as answer, plus the best “systematic way” i can think is just go by number of vertices.may be there is some formula for counting number of sub-graphs in some special graphs like cycle or complete graph but i don’t know about that. 2 votes 2 votes Please log in or register to add a comment.