0 votes 0 votes adarsh shivhare asked Dec 30, 2017 adarsh shivhare 2.7k views answer comment Share Follow See 1 comment See all 1 1 comment reply targate2018 commented Dec 30, 2017 reply Follow Share Check this : https://math.stackexchange.com/questions/1072726/counting-simple-connected-labeled-graphs-with-n-vertices-and-k-edges 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 6 vertices uses 12 edges given then using this data every graph has even length cycle occurs... So it is bipartite graph and we know bipartite graph has chromatic number is 2... So only 2 number of simple graphs possible mesh90 answered Dec 23, 2019 mesh90 comment Share Follow See all 0 reply Please log in or register to add a comment.
