Register

NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 7

• retagged by
938 views

1 Answer

1 1 vote

Ans: D) nd/2

Regular Graph: All Vertices have equal degree. (say “d”)

Here, Sum of Degree = n X d.   and total edges = say “e”

Since we know that in a graph the sum of all degrees is equal to twice the number of edges.

→ n X d = 2 X e

→ e = (n X d) / 2

Voting & Accepting an answer helps improve the community
Answer:
← Previous · NIELIT 2017 OCT Scie...Next → · NIELIT 2017 OCT Scie...
← Previous in category · NIELIT 2017 DEC Scie...Next in category → · NIELIT 2016 MAR Scie...
Position:
Show:

Related questions

1 1 vote
1 1 answer
780
780 views
admin asked Apr 1, 2020
780 views
NIELIT 2017 OCT Scientific Assistant A (CS) - Section C: 6
The solution of the recurrence relation$a_{r} = a_{r-1} + 2a_{r-2}$ with $a_{0} = 2,a_{1} = 7$ is$a_{r} = (3)^{r} + (1)^{r}$$2a_{r} = (2)^{r}/3 – (1)^{r}$$a_{r} = 3^{r+1}...
1 1 vote
1 1 answer
1.8k
1.8k views
admin asked Apr 1, 2020
1,800 views
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 1
A decimal has $25$ digits. The number of bits needed for its equivalent binary representation is approximately,$50$$74$$40$$60$
0 0 votes
1 1 answer
1.4k
1.4k views
admin asked Apr 1, 2020
1,389 views
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 2
Which of the following is minimum error code?Octal CodeBinary CodeGray CodeExcess-$3$ Code
3 3 votes
1 1 answer
1.4k
1.4k views
admin asked Apr 1, 2020
1,391 views
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 3
Match list $I$ with List $II$ and select the correct answer using the codes given below the lists.$${\begin{array}{|c|c|c|}\hline&\textbf{List I} & & \textbf{List II}\\\h...