retagged by
574 views

1 Answer

0 votes
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

 

Answer:

Related questions

0 votes
0 votes
1 answer
1
admin asked Mar 30, 2020
9,909 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$
0 votes
0 votes
1 answer
3
admin asked Mar 30, 2020
2,046 views
A path in graph $G$, which contains every vertex of $G$ and only once?Euler circuitHamiltonian pathEuler PathHamiltonian Circuit
0 votes
0 votes
1 answer
4
admin asked Mar 30, 2020
880 views
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...