0% found this document useful (0 votes)
32 views4 pages

Graph Theory MCQ

Uploaded by

rajivpathak80
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
32 views4 pages

Graph Theory MCQ

Uploaded by

rajivpathak80
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

What is the number of edges present in complete graph with n vertices.

A. n(n+1)/ 2

B. n(n−1) /2

C. n/ 2

D. n

ANSWER: B

A vertex which is not adjacent to every other vertex is called vertex.

A. Isolated

B. Pendant

C. Incident

D. Simple

ANSWER: B

Which of the following statements is/are TRUE for undirected graphs?

P:Number of odd degree vertices is even. Q:Sum of degrees of all vertices is even.

A. P only
B. B. Q only
C. Both P and Q
D. D. Neither P and Q

ANSWER: C

A graph is if it has at least one pair of vertices without a path between them.

A. Complete

B. Connected

C. Disconnected

D.Trivial

ANSWER: C

Let G be a simple graph with every pair of vertices is connected. Then G is


A. trivial

B.complete

C. disconnected

D. self complementary

ANSWER: B

Number of edges incident with the vertex V is called?

A. Degree of a graph

B. Handshaking lemma

C. Degree of a vertex

D. Degree of Graph

ANSWER: A

Which of the following properties does a simple graph not hold?

A. Must be connected

B. Must be unweighted

C.Must have no loops or multiple edges

D. Must have no edges

ANSWER: D

Degree of any vertex of a graph is

A. Number of vertices in a graph

B. The number of edges incident with the vertex

C. Number of edges in a graph

D. Number of vertices adjacent to that vertices

ANSWER: B

A graph with no edges is known as empty graph. Empty graph is also known as
A. Trivial graph

B. Regular Graph

C. Bipartite Graph

D. Pendent graph

ANSWER: B

A vertex of a graph is called even or odd depending upon

A. Total number of edges in a graph is even or odd

B. Total number of vertices in a graph is even or odd

C. Its degree is even or odd

D. None of these

ANSWER: C

Suppose v is an isolated vertex in a graph , then the degree of v is

A. 0

B. 1

C. 2

D. 3

ANSWER: A

The complete graph with 4 vertices has k edges where k is

A. 3

B. 4

C. 5

D. 6

ANSWER: B

A graph with one vertex and no edges is


A. Multigraph

B. Digraph

C. Isolated graph

D. Trivial graph

ANSWER: C

In any undirected graph the sum of degrees of all the nodes

A. Must be even

B. Must be odd

C. Need not be even

D. None of these

ANSWER: A

A vertex of D is pendant, if its degree is

A. 0

B. 1

C. 2

D. 3

ANSWER: B

The number of vertices of odd degree in a graph is always……..

A. Odd

B.even

C. 1

D. 0

ANSWER: B

You might also like