Scribd
Upload
20 views

Graph Theory question

Question paper of 2024 of ASTU

Uploaded by

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

Graph Theory question

Question paper of 2024 of ASTU

Uploaded by

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

"Total No.

of printed pages = 4
CSE 181405

Roll No. of candidate

2024

B.Tech. 4th Semester End-Term Examination

GRAPH THEORY

NewRegulation (w.e.f. 2017 - 18) &


New Syllabus (w.e.f. 2018- 19)
Full Marks - 70 Time -Three hours

The figures in the margin indicate full marks


for the questions.

Answer question No. 1and any four from the rest.


1 Choose the most appropriate choice to answer the following MCQ/ Fillthe blanks:
(10 ×1=10)
(i) In any simple connected graph withn vertices, the maximum degree of any
vertex is
(a) n-2 (b) n-1/
(c) (d) n +1

(ii) Adding one edge to a tree defines exactly


(a) zero cycle (by one cycle
(c) two cycles (d) four cycles
(iüi) There is only path(s) between each pair of vertices of a tree.
(a) 0 (b) 1
(c) 2 (d) More than 2
(iv) Eulerian Path is a path in agraph that visits
(a) every edge exactly once
(b) every vertex exactly once
(c) every edge at least once
(d) every vertex at least once
[(Turn over
(v) K, (complete graph of n vertices) is non-planar, for n equals to
(a) 2 (b) 3
(c) 4 (d) 5
(vi) Thickness of Ks (complete graph of 5 vertices) is
(a) 4 (b) 3
(d) 1
(c 2
connected simple graph must be
(vii) Number of vertices with odd degree in a
(a) Odd (b) 3
Even (d) 1
and
will be the chromatic number ofa tree having more than 1l vertex
(viii) What
height h?
(a) 0 (b) 1
(c) 2
(d) h/2
be
(ix) In aplanner graph, crossing number must
(a) 2
(b)
0

(d) n, where n can be any number


always equal to
(x) In any bipartite graph, number of odd length cycles is
(a) 3 (b) 2

(c) (d) 0

2. Consider the following graph G and answer the following questions.

(a) Is G acomplete graph? Justify, How many odd-length cycles exist in G? (4)
(b) Minimum how many edge(s) must be removed from the graph Gto make it a
tree? (2)
Not (c) Is G a bipartite graph? Justify. (5)
No (d) Among a group of 7 people, is it possible for everyone to be friends with
exactly 3of the people in the group? Justify . (4)
CSE 181405 2
questions with
3. Consider the following graph and answer the following
justification.

(a) Find each cut vertex, bridge, cut set and block that exist in the graph G
(if any exists). (8)

(b) "A simple connected graph with n number of vertices may have maximum
(n-2) cut vertices". Justify prove whether the statement is true or false. (4)

(c) "Every non-pendant vertex (vertex that has degree one) of a tree is a cut
vertex". Justify/prove whether the statement is true or false. (3)

4. (a) Find the number of edges in a rooted tree with n number of vertices and
height h. Justify your answer. (4)
of its
(b) "A connected simnple graph G is called a tree if the removal of any
edges makes G disconnected". Justify/prove whether the statement is true
or false. (4)

(c) State Menger's Theorem in graph theory and explain with example. (5)

(d) Every tree is a bipartite graph. Justify whether the statement is true or
false. (2)

5. (a) Define Eulerian and Hamiltonian graphs. Check if the graph given in
question number 6 is Eulerian or Hamiltonian. Justify. (7)
you
b) Consider a completely connected simple graph G of 99 vertices. Can
conclude that it has Euler circuit or it cannot have Euler circuit? Justify. (4)

(c)
Use Dirac's Theorem to prove that completely connected simple graph of
10 vertices is a Hamiltonian graph. (4)

CSE 181405 3 [Turn over


6. Consider the followinggraph Gand answer the following :

What is a planner graph? Is Gaplanner graph? Justify. (5)

Ub) Find the chromatienumber of the graph G. (3)

(e), Find thickness of graph G. (2)

d) Consider four subjects Mathematics, Management, Network and Algorithm.


How can we use graph coloring to schedule exams in minimum no of days so
that courses having common students are not held on same day? (5)

7. (a) Draw a maximal matching of the graph given in question number 6. (4)
(b) State and explain Turan's Theorem. (4)

(c) Explain graph decomposition with example. (4)


(d) Define Isomorphism and automorphism. (3)

CSE 181405 4

You might also like