Register

nielit 2017

634 views
0 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.

Voting & Accepting an answer helps improve the community
← Previous · CompilerNext → · Memory Management :...
← Previous in category · ME test series.Next in category → · Degree Sequence
Position:
Show:

Related questions

0 0 votes
1 1 answer
940
940 views
admin asked Apr 1, 2020
940 views
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 7
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 3 votes
3 3 answers
3.5k
3.5k views
admin asked Mar 31, 2020
3,501 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 20
Total number of simple graphs that can be drawn using six vertices are:$2^{15}$$2^{14}$$2^{13}$$2^{12}$
1 1 vote
1 answers 1 answer
2.6k
2.6k views
admin asked Mar 31, 2020
2,606 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 38
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 0 votes
1 1 answer
10.6k
10.6k views
admin asked Mar 30, 2020
10,601 views
NIELIT 2017 July Scientist B (IT) - Section B: 1
Given an undirected graph $G$ with $V$ vertices and $E$ edges, the sum of the degrees of all vertices is$E$$2E$$V$$2V$