0 0 votes how many subgraph with atleast 1 vertex does k2 have? (graph theory question) Mathematical Logic discrete-mathematics graph-theory + – shuham kumar 960 views answer comment Share Follow Print See all 5 Comments 5 5 Comments reply Chandrabhan Vishwa 1 commented Nov 18, 2022 reply Follow flag i think it should be 2 one itself and one is isolated vertex 1 1 replyShare Kabir5454 commented Nov 18, 2022 reply Follow flag 1 1 replyShare afroze commented Nov 18, 2022 reply Follow flag yes it should be 3 bcoz nothing is given about uniqueness 1 1 replyShare Aaru_2023 commented Nov 19, 2022 reply Follow flag why haven't you considered null graph with 2 vertices in both cases? 1 1 replyShare Kabir5454 commented Nov 19, 2022 reply Follow flag I think you are correct we should add +1 for each labelled and unlabelled case. 1 1 replyShare Please log in or register to add a comment.
0 0 votes ithink this formula should be better gor this type of solution $_{1}^{2}\textrm{c}$*2^n(n-1)/2 shuham kumar answered Dec 4, 2022 shuham kumar comment Share Follow 0 reply Please log in or register to add a comment.
