A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Maximum degree of any vertex in a simple graph of vertices n is
a. 2n - 1
b. n
c. n + 1
d. n - 1
Answer:n - 1
Rio :(February 03, 2020) How can I prove it?
Click to Add Comment
nivetha s :(August 13, 2018) If n=3,the statement a [++n]=n++;will;
Click to Add Comment
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions:

The minimum number of colors needed to color a graph having n (>3) vertices and 2 edges is
What is the number of words that can be formed from the given Directed Acyclic Word Graph?
From a complete graph, by removing maximum _______________ edges, we can construct a spanning tree.
If A[x+3][y+5] represents an adjacency matrix, which of these could be the value of x and y.
For an undirected graph G with n vertices and e edges, the sum of the degrees of each vertex is
Determine the number of vertices for the given Graph or Multigraph?
G is a 4-regular Graph having 12 edges.
Which of the following is true?
In which of the following case does a Binary Decision Diagram is used for?
And Inverter Graph is a type of __________
For any two different vertices u and v of an Acyclic Directed Graph if v is reachable from u, u is also reachable from v?
Get it on Google Play

GATE CSE Resources

Questions from Previous year GATE question papers

UGC NET Computer science Resources

UGC NET Previous year questions and practice sets

NET General Paper 1

UGC NET Previous year questions and practice sets

GATE CSE Online Test

Attempt a small test to analyze your preparation level. This GATE exam includes questions from previous year GATE papers.

UGC NET practice Test

Practice test for UGC NET Computer Science Paper. The questions asked in this NET practice paper are from various previous year papers.