BCS405B

Model Question Paper-II with effect from 2022(CBCS Scheme)
USN
Fourth Semester B.E Degree Examination

GRAPH THEORY (BCS405B)
TIME:03Hours Max.Marks:100
Note:
1. Answer any FIVE full questions, choosing at least ONE question from each
MODULE
2. VTU Formula Hand Book is Permitted
3. M: Marks, L: RBT levels, C: Course outcomes.
Module – 1 M L C
Q.1 a Consider the following graph 𝐺. 6 L2 CO1
(i) What type of a graph is 𝐺?
(ii) Find the pendant vertices in 𝐺.
(iii) How many components are there in 𝐺?
(iv) Find the minimum degree, 𝛿(𝐺) in 𝐺.
(v) Find the average degree, 𝑑(𝐺) of the graph 𝐺.
Draw two vertex disjoint subgraphs of 𝐺.
b Show that the number of vertices of odd degree in a graph is always even. 7 L3 CO1
c Show that the maximum number of edges in a simple graph with 𝑛 vertices 7 L3 CO1
𝑛(𝑛 – 1)
is 2
.
OR
Q.2 a Distinguish between Complete graph and Complete Bipartite graph. 6 L2 CO1
b Verify whether the following graphs are isomorphic or not. 7 L2 CO1
c Show that a simple graph with 𝑛 vertices and 𝑘 components can have at most 7 L3 CO1
(𝑛 − 𝑘)(𝑛 − 𝑘 + 1)
2
edges.
Module – 2
Q.3 a By specifying the walk, draw two Euler graphs and an Unicursal graph. 6 L2 CO2
If all the vertices in a connected graph 𝐺 are of even degree, then show that 𝐺
b is Eulerian. 7 L3 CO2
c Define Hamiltonian cycle. How many edge-disjoint Hamiltonian cycles exist 7 L1 CO2
in a complete graph with 5 vertices? Draw the graph to show and specify the
cycle.
OR
Define Hamiltonian graph. By specifying the walk, draw a graph that has a
Q.4 a Hamiltonian path but does not have a Hamiltonian circuit. 6 L1 CO2
Show that a connected graph 𝐺 has an Eulerian trail if and only if there are
b exactly two vertices of odd degree in 𝐺. 7 L3 CO2
c (i) Prove that in any digraph the sum of the in-degrees of all
vertices is equal to the sum of their out-degrees; and this sum is equal 7 L3 CO2
to the number of edges in the digraph.
(ii) Draw a complete symmetric digraph and a complete asymmetric
digraph with 4 vertices.
Module – 3
(i) Show that the number of vertices in a binary tree is always odd. 6 L3 CO3
Q.5 a (ii) Find the number of pendant vertices in a binary tree of order 𝑛.
b Prove that a connected graph G is a tree if and only if there is one and only one 7 L3 CO3
path between every pair of vertices.
c Show that a tree with 𝑛 vertices has 𝑛 − 1 edges. 7 L3 CO3
OR
(i) Show that every connected graph contains a spanning tree.
Q.6 a (ii) Find the number of tree branches and chords in the following graph 6 L3 CO3
with 7 vertices and 14 edges.
Define Fundamental Circuit. If 𝐺 is a graph with 𝑛 vertices and 𝑞 edges, then

b find the number of fundamental circuits in the graph. 7 L1 CO3
Show that for any graph 𝐺, the vertex connectivity cannot exceed the edge
c connectivity and the edge connectivity cannot exceed the degree of the vertex 7 L3 CO3
with the smallest degree in 𝐺.
Module – 4
(i) Define planar and non-planar graphs.
Q.7 a (ii) State Kuratowski’s theorem. Draw Kuratowski’s two graphs. 6 L1 CO4
Show that a connected planar graph with 𝑛 vertices and 𝑒 edges has 𝑒 − 𝑛 + 2
b regions. 7 L3 CO4
1. Draw the geometric dual of the graph G.
c 2. Write down the adjacency matrix for the graph G. 7 L2 CO4
OR
If 𝐺 is a simple planar graph with at least three vertices, then show that (i)
Q.8 a 𝑒 ≤ 3𝑛 − 6. and (ii) 𝑒 ≤ 2𝑛 − 4 ; if 𝐺 is triangle free. 6 L3 CO4
b (i) Show that Petersen graph is non-planar. 7 L3 CO4
(ii) Let 𝐺 be a planar graph. Then prove that it contains a vertex of degree
at most 5.
c Write down the Path matrix and Circuit matrix for the given graph. 7 L2 CO4
Module – 5
Q.9 a Prove that every tree with two or more vertices is 2-chromatic. 6 L3 CO5
b Define chromatic number of a graph. Find the chromatic polynomial and 7 L1 CO5
chromatic number for the given graph.
c Define Matching and complete matching. Obtain two complete matching from 7 L1 CO5
the given graph.
OR
Q.10 a Prove that an 𝑛 -vertex graph is a tree if and only if its chromatic polynomial 6 L3 CO5
is 𝑃𝑛 (𝜆) = 𝜆(𝜆 − 1)𝑛−1 .
b Define Covering and minimal covering of a graph. 7 L1 CO5
Obtain two minimal coverings from the given graph.
c State and prove Five color theorem. 7 L2 CO5

BCS405B

Uploaded by

Copyright:

Available Formats

BCS405B

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

BCS405B

Uploaded by

Copyright:

Available Formats

Model Question Paper-II with effect from 2022(CBCS Scheme)

Fourth Semester B.E Degree Examination

Define Fundamental Circuit. If 𝐺 is a graph with 𝑛 vertices and 𝑞 edges, then

c State and prove Five color theorem. 7 L2 CO5

You might also like