Register

NIELIT 2017 July Scientist B (IT) - Section B: 15

• retagged by
873 views

1 Answer

0 0 votes

A diagonal is a line segment joining two vertices whereas those vertices are not sharing the same edge.

Therefore,

The number of diagonals that can be drawn by joining ‘n’ vertices =  (Total edges possible) – n

                                                                                                                     = C(n,2) – n

So for octagon the no. of diagonals possible = 20

(C) is the answer

 

Voting & Accepting an answer helps improve the community
Answer:
← Previous · NIELIT 2017 July Sci...Next → · NIELIT 2017 July Sci...
← Previous in category · NIELIT 2017 July Sci...Next in category → · NIELIT 2017 July Sci...
Position:
Show:

Related questions

0 0 votes
1 1 answer
10.6k
10.6k views
admin asked Mar 30, 2020
10,574 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$
0 0 votes
3 3 answers
19.6k
19.6k views
admin asked Mar 30, 2020
19,571 views
NIELIT 2017 July Scientist B (IT) - Section B: 2
Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph?In adjacency list representation, space is saved f...
0 0 votes
1 1 answer
2.6k
2.6k views
admin asked Mar 30, 2020
2,569 views
NIELIT 2017 July Scientist B (IT) - Section B: 3
A path in graph $G$, which contains every vertex of $G$ and only once?Euler circuitHamiltonian pathEuler PathHamiltonian Circuit
1 1 vote
1 1 answer
1.4k
1.4k views
admin asked Mar 30, 2020
1,373 views
NIELIT 2017 July Scientist B (IT) - Section B: 5
In a given following graph among the following sequences: abeghf abfehgabfhgeafghbe Which are depth first traversals of the above graph?I,II and IV onlyI and IV onlyII,II...