2 votes 2 votes The number of vertices,edges and colors required for proper coloring in Tripartite graph K<3,2,5> will be : 10 , 31 , 3 10 , 30 , 3 10 , 30 , 2 None Graph Theory discrete-mathematics graph-theory made-easy-test-series + – Na462 asked Jan 16, 2019 • edited Mar 3, 2019 by ajaysoni1924 Na462 517 views answer comment Share Follow See 1 comment See all 1 1 comment reply Na462 commented Jan 17, 2019 reply Follow Share The answer is A help here :( 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes Sry for the quality.. muthu kumar answered Jan 17, 2019 muthu kumar comment Share Follow See all 0 reply Please log in or register to add a comment.