Scribd
Upload
4 views4 pages

DM unit 5

The document contains a series of multiple-choice questions related to graph theory, covering topics such as types of graphs, properties of vertices, edges, and paths, as well as specific graph characteristics like chromatic numbers and spanning trees. Each question presents four answer options, testing knowledge on various concepts within the field. The questions range from basic definitions to more complex properties of graphs.

Uploaded by

er3586
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
4 views4 pages

DM unit 5

The document contains a series of multiple-choice questions related to graph theory, covering topics such as types of graphs, properties of vertices, edges, and paths, as well as specific graph characteristics like chromatic numbers and spanning trees. Each question presents four answer options, testing knowledge on various concepts within the field. The questions range from basic definitions to more complex properties of graphs.

Uploaded by

er3586
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

1.

A graph in which loops and parallel edges are allowed is called graph

(A) Pseudo (B) Multi

(C) Simple (D) Bipartite

2. The degree of V5 in the following graph is

(A) 3 (B) 2

(C) 1 (D) 0

3. A connected graph without any circuit is called

(A) Leaf (B) Flower

(C) Loop (D) Tree

4. The chromatic number for the following graph is

(A) 4 (B) 3

(C) 2 (D) 1

5. The maximum number of edges in a simple disconnected graph with S vertices and 2
components is

(A) 19 (B) 20

(C) 21 (D) 22

6. Every connected graph has atleast

(A) One spanning tree (B) Two spanning tree

(C) Three spanning tree (D) Four spanning tree


7. A tree with 10 vertices has

(A) 8 edges (B) 9 edges

(C) 10 edges (D) 11 edges

8. The chromatic number of a complete graph Ka with n vertices is

(A) n-1 (B) n

(C) n+1 (D) n+2

9. A graph G is said to be a simple graph

(A) G has no loops (B) There is exactly one edge between


any given pair of vertices

(C) Both (A) and (B) (D) It contains only parallel edges

10. If G is an undirected graph with 12 edges. Also, it is given that two vertices area of
degree 2, two are of degree 3, and one of degree 4 and remaining are of degree 5. How
many total vertices are there in G?

(A) 8 (B) 7

(C) 9 (D) 10

11. A path in a connected graph G = V,E) is called Hamilton path if

(A) It includes every edge exactly once (B) It includes every vertex exactly once

(C) It includes every edge (D) It includes every vertex exactly twice

12. A degree of pendent vertex is

(A) 0 (B) 1

(C) 2 (D) 3

13. Graphs that include loops and possibly multiple edges connecting the same pair of
vertices is called

(A) Pseudo graph (B) Bipartite graph

(C) Complete graph (D) Directed graph


14. The maximum number of edges in a simple disconnected graph with n vertices and k
components is

((n + k)(n + k + 1))/2 (v)

(C) ((n - k)(n - k + 1))/2

(B) ((n + k)(n - k + 1))/2

(D) ((n - k)(n + k + 1))/2

15. A path in a graph G that includes each vertex exactly once is

(A) Euler path (B) Simple path

(C) Hamiltonian path (D) Cyclic path

16. The chromatic number of the complete bipartite graph K 4, 3

(A) 2 (B) 3

(C) 6 (D) 5

17. If G = (V, E) is an undirected graph with 5 edges then ∑deg (Vi) =

(A) 10 (C) 11

(B) 5 (D) 12

18. The maximum number of edges in a simple disconnected graph G with n vertices and

k components is

(A) ((n + k)(n - k + 1))/2

(C) (n(n - k + 1))/2


(B ) ((n - k)(n - k + 1))/2

(D) ((n - k) ^ 2)/2

19. A connected graph contains an Euler circuit iff each of its vertices is of

(A) Even degree (B) Odd degree

(C) Prime degree (D) Neither odd nor even

20. The chromatic number of a planar graph is not greater than

(A) 3 (B) 4

(C) 5 (D) 6.

21. A tree with 100 vertices has

(A) 98 edges (B) 96 edges

(C) 100 edges (D) 99 edges

22. The degree of pendant vertex.

(A) 0 (B) 1

(C) 2 (D) 3

You might also like