1,264 views

1 Answer

0 votes
0 votes

Answer is option a).

From Euler's formula one can derive the following estimate

If GG is a bipartite graph with vv vertices and ee edges then e≤2v−4.

Please kindly visit d link below for more information. I Hopeit helps u. 

http://math.stackexchange.com/questions/149125/what-is-the-maximum-number-of-edges-in-a-planar-bipartite-graph-which-have-parti

Related questions

0 votes
0 votes
2 answers
1
0 votes
0 votes
2 answers
2
yuuchan asked Jul 22, 2023
477 views
If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____1n-1⌊n/2⌋⌈n/2⌉
0 votes
0 votes
1 answer
4
Lakshman Bhaiya asked Oct 10, 2018
1,179 views
The number of ways to properly color (using just sufficient colors) a connected graph without any cycle using five colors, such a way that no two adjacent nodes have the ...