323 views
0 votes
0 votes

If G is an undirected planar graph on n vertices with e edges then

A) e<=n

B) e<=2n

C) e<=3n

D) None of the option

plz explain it with solutions

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
admin asked Apr 1, 2020
559 views
The number of the edges in a regular graph of degree $’d’$ and $’n’$ vertices is Maximum of $n,d$$n+d$$nd$$nd/2$
3 votes
3 votes
3 answers
2
admin asked Mar 31, 2020
2,264 views
Total number of simple graphs that can be drawn using six vertices are:$2^{15}$$2^{14}$$2^{13}$$2^{12}$
1 votes
1 votes
1 answer
3
admin asked Mar 31, 2020
2,130 views
If a planner graph, having $25$ vertices divides the plane into $17$ different regions. Then how many edges are used to connect the vertices in this graph.$20$$30$$40$$50...
0 votes
0 votes
1 answer
4
admin asked Mar 30, 2020
9,911 views
Given an undirected graph $G$ with $V$ vertices and $E$ edges, the sum of the degrees of all vertices is$E$$2E$$V$$2V$