Register

NIELIT 2016 MAR Scientist B - Section B: 3

• retagged by
660 views
0 votes
0 votes

Maximum degree of any node in a simple graph with $n$ vertices is

  1. $n-1$
  2. $n$
  3. $n/2$
  4. $n-2$
• retagged by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
admin asked Mar 31, 2020
2,069 views
NIELIT 2016 MAR Scientist B - Section B: 1
The number of ways to cut a six sided convex polygon whose vertices are labeled into four triangles using diagonal lines that do not cross is $13$ $14$ $12$ $11$
The number of ways to cut a six sided convex polygon whose vertices are labeled into four triangles using diagonal lines that do not cross is$13$$14$$12$$11$
User Avatar
0 votes
0 votes
1 answer
2
admin asked Mar 30, 2020
9,944 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$
Given an undirected graph $G$ with $V$ vertices and $E$ edges, the sum of the degrees of all vertices is$E$$2E$$V$$2V$
User Avatar
0 votes
0 votes
0 answers
3
admin asked Mar 30, 2020
1,191 views
NIELIT 2017 July Scientist B (CS) - Section B: 2
Which of the following statements is/are TRUE for an undirected graph? Number of odd degree vertices is even Sum of degrees of all vertices is even P only Q only Both P and Q Neither P nor Q
Which of the following statements is/are TRUE for an undirected graph?Number of odd degree vertices is evenSum of degrees of all vertices is evenP onlyQ onlyBoth P and QN...
User Avatar
Link Copied!