0 votes 0 votes The graph K3,4 has: $3$ edges $4$ edges $7$ edges $12$ edges Graph Theory ugcnetcse-dec2008-paper2 graph-theory + – rishu_darkshadow asked Sep 25, 2017 edited Jun 19, 2020 by soujanyareddy13 rishu_darkshadow 905 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 0 votes 0 votes Its complete bipartite graph k3,4 will have 3 x 4 =12 edges stblue answered Sep 25, 2017 selected Sep 26, 2017 by rishu_darkshadow stblue comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes For bipartile graph K3,4 no. of vertices= 3+4=7 no. of edges=3*7=12 Ans: D rishu_darkshadow answered Sep 26, 2017 rishu_darkshadow comment Share Follow See all 0 reply Please log in or register to add a comment.