1 votes 1 votes If G is a bipartate planar graph with 'n' vertices, then maximum number of edges in G is ____________ ? A) 2n-4 B) 3n-2 C) n-2 D) n Jithin Jayan asked Feb 1, 2017 Jithin Jayan 470 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments saurabh rai commented Feb 1, 2017 reply Follow Share http://math.stackexchange.com/questions/455690/prove-that-a-simple-planar-bipartite-graph-on-n-nodes-has-at-most-2n-4-edges 3 votes 3 votes Jithin Jayan commented Feb 1, 2017 reply Follow Share Thank you so much :) 0 votes 0 votes Kaushik.P.E commented Feb 2, 2017 reply Follow Share planarity is no longer in syllabus. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes It can also be given as..max. no of edges= floor((n2)/4 ) Smriti012 answered Feb 1, 2017 Smriti012 comment Share Follow See all 0 reply Please log in or register to add a comment.