Register

NIELIT 2017 DEC Scientific Assistant A - Section B: 38

• retagged by
2,163 views

1 Answer

Best answer
4 votes
4 votes

We use Euler's formula for planar graphs :  $v-e+f=2$  where,

  • $v\;-$ no. of vertices,  
  • $e\;-$ no.of edges  and  
  • $f\;-$ no. of faces.  (Refer: Euler's Formula)


So,  $25-e+17=2$  $\Rightarrow$ $e=40$

Option C is correct.

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
3 answers
1
admin asked Mar 31, 2020
2,336 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}$
Total number of simple graphs that can be drawn using six vertices are:$2^{15}$$2^{14}$$2^{13}$$2^{12}$
User Avatar
1 votes
1 votes
1 answer
2
admin asked Mar 31, 2020
1,305 views
NIELIT 2016 DEC Scientist B (CS) - Section B: 5
Let $G$ be a simple undirected planar graph on $10$ vertices with $15$ edges. If $G$ is a connected graph, then the number of bounded faces in any embedding of $G$ on the plane is equal to: $3$ $4$ $5$ $6$
Let $G$ be a simple undirected planar graph on $10$ vertices with $15$ edges. If $G$ is a connected graph, then the number of bounded faces in any embedding of $G$ on the...
User Avatar
2 votes
2 votes
4 answers
3
admin asked Mar 31, 2020
2,963 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 1
Correct expression tor UDP user datagram length is length of UDP = length of IP- length of IP header's length of UDP= length of UDP-length of UDP header's length of UDP = length of IP+length of IP header's length of UDP = length of UDP+length of UDP header's
Correct expression tor UDP user datagram length islength of UDP = length of IP- length of IP header'slength of UDP= length of UDP-length of UDP header'slength of UDP = le...
User Avatar
2 votes
2 votes
2 answers
4
admin asked Mar 31, 2020
967 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 2
In binary search tree which traversal is used for getting ascending order values ? Inorder Preorder Postorder None of the options
In binary search tree which traversal is used for getting ascending order values ?InorderPreorderPostorderNone of the options
User Avatar
Link Copied!