Scribd
Upload
12 views

GT Model QP

This document is a model question paper for the BCS405B course on Graph Theory for the Fourth Semester B.E. in Information Science & Engineering at The National Institute of Engineering, Mysuru. It includes a variety of questions covering topics such as infinite graphs, isomorphic graphs, Euler graphs, Hamiltonian circuits, decision trees, spanning trees, and chromatic numbers. The paper is structured into sections with cognitive levels and marks assigned to each question.

Uploaded by

sujay15042005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views

GT Model QP

This document is a model question paper for the BCS405B course on Graph Theory for the Fourth Semester B.E. in Information Science & Engineering at The National Institute of Engineering, Mysuru. It includes a variety of questions covering topics such as infinite graphs, isomorphic graphs, Euler graphs, Hamiltonian circuits, decision trees, spanning trees, and chromatic numbers. The paper is structured into sections with cognitive levels and marks assigned to each question.

Uploaded by

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

MODEL QUESTION PAPER BCS405B

FOURTH SEMESTER B.E. INFORMATION SCIENCE & ENGINEERING


Model Question Paper
The National Institute of Engineering, Mysuru.

GRAPH THEORY
Time: 3 hrs. Max. Marks: 100

[Note: Answer all questions]

Cognitive
Q.
CO’s Level Questions Marks
No.

Show that an infinite graph with a finite number of vertices (i.e., a graph
with a finite number of vertices and an infinite number of edges) will
L2 1. a 6
have at least one pair of vertices (or one vertex in case of parallel self
loops) joined by an infinite number of parallel edges.
Prove that the maximum number of edges in a simple graph with n
L2 1. b 6
vertices is n(n – l)/2.

What are isomorphic graphs? Determine whether or not the two graphs
are isomorphic?
CO1

L3 1. c 8

Prove that “A given connected graph G is an Euler graph if and only if


CO1,
L2 2. a all vertices of G are of even degree.” And hence prove that Königsberg 10
CO2
Bridge Problem has no solution.
Given the set of cubes represented by the graph in Fig. 2-6, is it possible
to stack all four cubes into a column such that each side shows only one
color? Explain.

CO1,
L3 2. b 10
CO2
OR

CO1, Prove that “In a complete graph with n vertices there are (n − l)/2 edge-
L2 2. c 10
CO2 disjoint Hamiltonian circuits, if n is an odd number ≥ 3”.

Prove that in any digraph the sum of the in-degrees of all vertices is equal
CO1,
L3 2. d to the sum of their out-degrees; and this sum is equal to the number of 10
CO2
edges in the digraph.
Suppose you are given eight coins and are told that seven of them are of
equal weight, and one coin is either heavier or lighter than the rest. You
are provided with an equal-arm balance, which you may use only three
CO2 L3 3. a 10
times, for comparing coins. Sketch a strategy in the form of a decision
tree for identifying the nonconforming coin, as well as for finding out
whether it is heavier or lighter than the rest.
Prove that “The ring sum of any two cutsets in a graph is either a third
CO2 L2 3. b 10
cut-set or an edge disjoint union of cutsets”.
OR
What are Spanning Trees? Can you construct a graph if you are given
CO2 L3 3. c 10
all its spanning trees? How?

Prove that in a connected graph G the complement of a cut-set in G does


CO2 L2 3. d not contain a spanning tree and the complement of a spanning tree (i.e., 10
chord set) does not contain a cut-set.
CO3 L2 4. a Prove that Kuratowski’s second graph is nonplanar. 6
A simple planar graph to which no edge can be added without destroying 6
its planarity (while keeping the graph simple, of course) is called a
CO3 L2 4. b
maximal planar graph. Prove that every region in a maximal planar graph
is a triangle.
Write the steps to find the dual of a graph. Find dual of the following 8
graph:

CO3 L3 4. c

What are Chromatic Numbers? Prove that Every tree with two or more 10
CO3 L2 5.a
vertices is 2-chromatic.
In a village there are an equal number of boys and girls of marriageable 10
age. Each boy dates a certain number of girls and each girl dates a certain
CO3 L3 5.b number of boys. Under what condition is it possible that every boy and
girl gets married to one of their dates? (Polygamy and polyandry not
allowed.)

***********************

You might also like