0 votes 0 votes closed with the note: https://gateoverflow.in/285/isro2008-29 shivanisrivarshini asked Jun 21, 2016 • closed Jun 21, 2016 by LeenSharma shivanisrivarshini 913 views comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments srestha commented Jun 21, 2016 reply Follow Share why not 10? Simple graph should not be no self loop and no multiple edge rt? 0 votes 0 votes LeenSharma commented Jun 21, 2016 reply Follow Share 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 votes 1 votes srestha commented Jun 21, 2016 reply Follow Share yes I missed that one , yes I got it , thanks :) 1 votes 1 votes Please log in or register to add a comment.