0 0 votes closed with the note: https://gateoverflow.in/285/isro2008-29 Algorithms + – shivanisrivarshini 1.4k views comment Share Follow Print See all 5 Comments 5 5 Comments reply Desert_Warrior commented Jun 21, 2016 reply Follow flag https://gateoverflow.in/285/isro2008-29 Hey All ISRO questions have been posted.. You can ask @jothee about this.. you can search question in that top right corner search box.. 1 1 replyShare Tauhin Gangwar commented Jun 21, 2016 reply Follow flag https://gateoverflow.in/285/isro2008-29 0 0 replyShare srestha commented Jun 21, 2016 reply Follow flag why not 10? Simple graph should not be no self loop and no multiple edge rt? 0 0 replyShare LeenSharma commented Jun 21, 2016 reply Follow flag According to you answer should be 11.You missed one graph . Now, Question is asking about distinct graph . But here graphs (1) , (2) , (3) and (4) , (5) , (6) are isomorphic to each other .Hence (1) , (2) , (3) counted as 1 graph and (4) , (5) , (6) counted as 1 graph. Hence, Total possible graph with 1 node = 1 Total possible graph with 2 node=2 Total possible graph with 3 node=4 Total possible graph = 1+2+4 =7 1 1 replyShare srestha commented Jun 21, 2016 reply Follow flag yes I missed that one , yes I got it , thanks :) 1 1 replyShare Please log in or register to add a comment.
