Scribd
Upload
36 views

Graph Theory Paper (2)

This document is an examination paper for a Graph Theory & Combinatorics course at Harish Chandra PG College, covering various concepts related to undirected graphs, planar graphs, and graph properties. It includes multiple-choice questions on topics such as graph degree sequences, traversal algorithms, and properties of complete graphs. The paper is designed for BCA IV semester students and consists of 25 questions with a maximum score of 25 marks.

Uploaded by

praveenyadavjmd1507
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
36 views

Graph Theory Paper (2)

This document is an examination paper for a Graph Theory & Combinatorics course at Harish Chandra PG College, covering various concepts related to undirected graphs, planar graphs, and graph properties. It includes multiple-choice questions on topics such as graph degree sequences, traversal algorithms, and properties of complete graphs. The paper is designed for BCA IV semester students and consists of 25 questions with a maximum score of 25 marks.

Uploaded by

praveenyadavjmd1507
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

FACULTY OF MANAGEMENT AND TECHNOLOGY

HARISH CHANDRA PG COLLEGE, BAWAN BEEGHA VARANASI

Graph Theory & Combinatorics


Paper code: : BCA-S 210E1 BCA IV SEM Max. Marks: 25
Time: 11:30 to 12:30 I Sessional Date: 07/05/2024
Name:-
Roll No:- II Meeting
Invigilator’s Sign:-

1. 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) Q only (c) Both P and Q (d) Neither P and Q

2. Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a


connected graph, then the number of bounded faces in any embedding of G on the
plane is equal to

(a) 6 (b) 5 (c) 4 (d) 3

3. Which of the following graphs is isomorphic to


(a) A (b) B (c ) C (d) D

4. The degree sequence of a simple graph is the sequence of the degrees of the
nodes in the graph in decreasing order. Which of the following sequences cannot
be the degree sequence of any graph?

(I) 7, 6, 5, 4, 4, 3, 2, 1

(II) 6, 6, 6, 6, 3, 3, 2, 2

(III) 7, 6, 6, 4, 4, 3, 2, 2

(IV) 8, 7, 7, 6, 4, 2, 1, 1

(a) I and II (b) III and IV

(c) IV only (d) II and IV

5. If the origin and terminus of a walk are same, the walk is known as..

(a) Open (b) Closed (c) Path (d) None of these

6. Which of the following is true, if 𝑛 is the number of vertices , 𝑚 is the number of


edges and 𝑓 is the number of faces of a connected plane graph.

a) 𝑛 + 𝑚 + 𝑓 = 2 b) 𝑛 − 𝑚 + 𝑓 = 2
c) 𝑛 − 𝑚 − 𝑓 = 2 d) 𝑛 + 𝑚 − 𝑓 = 2
7. The number of vertices of odd degree in a graph is always……..

(a) Odd (b) even (c) 1 (d) 0

8. A connected graph without cycles is called

(a) Tree (b) bipartite graph


(c) Component (d) complete graph

9. The number of edges in a tree on n vertices is


(a) n (b) 1 (c) n-1 (d) n-2
10. A graph in which loops and parallel edges are allowed is called a

a) vertices b)edges

c) Degree of a vertex d) pseudo graph

11. If every vertex of a simple graph has the same degree , then the graph is called

a) Complete Graph b) Regular Graph


c) bi-partite Graph d) sub-graph

12. The maximum number of edges in a simple graph with n vertces is

a) n(n-1)/2 b) (n-1)/4
c) (n-1)/5 d) n/2

13. A connected planar graph having 6 vertices, 7 edges contains regions.


(a) 1 (b) 3
(c) 5 (d) 7

14. For a given graph G having v vertices and e edges which is connected and has
no cycles, which of the following statements is true?

(a) v=e (b) v=e+ 1 (c) v+ 1 = e (d) v=e−1

15. Let G be a simple graph. Which of the following statements is true?

P: Adjacency matrix is symmetric.


Q: Trace of adjacency matrix is 1.

(a) P only (b) Q only (c) Both P and Q (d) Neither P and Q

16. Total number of edges of a complete graph Km,n


(a) m+n (b) m−n (c) mn (d) m

17. Self-loops are counted ____?


(a) Once (b) Twice (c) Thrice (d) Multiple times
18. Consider a complete graph G with 4 vertices. The graph G has ____ spanning
trees.
a) 15 b) 8 c) 16 d) 13

19. The adjacency matrix of the complete graph K4 is ?

20. What graph traversal algorithm uses a stack to keep track of vertices which need
to be processed?

(a) BFS (b) DFS (c) Level Order Search (d) None of these

21. Which algorithm is used to find the shortest path in a weighted graph?

(a) Prim’s algo (b) Kruskal’s Algo (c) Dijkstra’s Algo (d) None of these

22. We have a simple graph G, which contains 21 edges and 10 vertices. Now find
out the number of edges in the complement of graph G .

(a) 21 (b) 22 (c) 23 (d) 24

23. We have a simple graph G and a complement graph G`. The graph G contains
the 30 edges and G` contains the 36 edges. Now find out the number of vertices
in graph G.
(a) 11 (b) 12 (c) 13 (d) 14
24. The no of edges in a regular graph of degree d and n vertices is
(a) Maximum of n and d. (b) n+d

( c) nd (d) nd/2

25. I. Every bipartite graph contains an odd cycle.


II. Every tree is a bipartite graph.
(a) I is true and II is false (b) I is false and II is true
(c) I and II are false (d) I and II are true

Answer:-
1 2 3 4 5
6 7 8 9 10
11 12 13 14 15
16 17 18 19 20
21 22 23 24 25

Student Sign:- _______________________________

Examiner’s Sign:- _____________________________

You might also like