Institute of Technical Education & Research, SOA University

(b) Prove that every r − regular bipartite graph (r  1) has a perfect 2 END SEMESTER EXAMINATION, APRIL-2019
matching. INTRODUCTORY GRAPH THEORY (CSE 1004)
(c) Define 1-factor of a graph and determine whether the given graph 2
has a 1-factor or not and is 1-factorable or not.
Programme: B.Tech Semester: 2nd
Full Marks: 60 Time: 3 Hours

Subject/Course Learning Outcome *Taxonomy Ques. Mark

Level Nos. s
Analyze graphs and graph models, connected L2, L3, 1(a),1(b), 2,2,
graphs, multigraphs, digraphs and regular L3, L3, 1(c),2((a), 2,2,
L3, L3 2(b),2(c), 2,2,
graphs as well as discuss the degree sequence
L3, L3,L3 7(a),7(b),7(c) 2,2,2
of graphs.
9. (a) Prove that if G is a planar graph of order n  3 and size m , then 2 Discuss and analyze the isomorphism of L3, L3, 3(a),3(b), 2,2,
m  3n − 6 . graphs. L3 3(c) 2
(b) A connected k − regular of order 12 is embedded in the 2 Define bridges, trees, spanning trees and L3, L3, 4(a),4(b), 2,2,
L3 4(c) 2
plane resulting in eight regions. Determine k . study its various concepts and apply the
(c) Determine whether the graph K 4  K 2 is planar or nonplanar. 2 Kruskal’s and Prim’s algorithms to find the
minimum spanning tree of a connected
weighted graph.
10 (a) Define the chromatic number of a graph and determine 2 Define cut-vertices, blocks and analyze the L2, L3, 5(a),5(b), 2,2,
. the chromatic number of the Peterson graph.
connectivity of graphs. L3 5(c) 2
(b) Prove that a graph has chromatic number 2 if and only if 2
Define Eulerian and Hamiltonian graphs and L2, L3, 6(a),6(b), 2,2,
G is a nonempty bipartite graph. study its various properties and applications. L3 6(c) 2
(c) Ten students have applied for the courses they plan to take 2 Define and discuss matchings and L3, L3, 8(a),8(b), 2,2,
from the subjects given: Graph Theory(GT), Statistics(S), factorization of graphs and study its L3 8(c) 2
Linear Algebra(LA), Advanced Calculus(AC), Geometry(G) applications.
and Modern Algebra(MA) as follows: Discuss and analyze planar graphs and study its L3, L3, 9(a),9(b), 2,2,
A: LA, S ; B: MA, LA, G ; C: MA, G, LA ; D: G, LA, AC ; various applications as well as discuss graph L3, L3, 9(c),10(a), 2,2,
E: AC, LA, S ; F: G, AC ; G: GT, MA, LA ; H: LA, GT, S ; coloring and its application to scheduling L3, L3 10(b),10(c) 2,2
I: AC, S, LA ; J: GT, S problems.
Use graph theory to determine the minimum number of *Bloom’s taxonomy levels: Knowledge (L1), Comprehension (L2), Application
time periods needed to offer these courses so that every 2 (L3), Analysis (L4), Evaluation (L5), Creation (L6)
courses having a common student are taught during Answer all questions. Each question carries equal mark.
different periods.
*End of Questions*
1. (a) Define the diameter of a graph and give an example of a 2
connected graph G containing three vertices u , v and w such
that d (u , v) = d (v, w) = d ( w, u ) = diam(G ) = 3.

Page 4of 4 ` page 1 of 4

 (b) Let G be a graph of order 3 or more. If G contains two distinct 2 (c) Define minimum spanning tree and use Prim’s algorithm to find 2
vertices u and v such that G − u and G − v are connected then the minimum spanning tree of the given weighted graph.
prove that G itself is connected.

(c) Determine whether the given graph is bipartite or not. If yes, 2

then redraw it as a bipartite graph and write its partite sets.

5. (a) Define cut-vertices and blocks and give an example of a graph 2

containing 2 cut-vertices and 3 blocks.
(b) Let R be the relation defined on the edge set of a nontrivial 2
connected graph G by eRf , where e, f  E (G ) , if e = f or e
and f lie on a common cycle of G . Then prove that R is an
2. (a) Prove that every graph has an even number of vertices of 2
odd degree. equivalence relation.
(b) Let v be a vertex of a graph G . Show that if G − v is 2 (c) Prove that if G is a cubic graph , then  (G ) =  (G ) . 2
3-regular, then G has odd order. 6. (a) Define an Eulerian graph G and give an example of a graph G 2
(c) Determine whether the following sequence is graphical or not. If 2
such that both G and G are Eulerian.
yes, construct the graph.
(b) Prove that if a nontrivial connected graph G contains exactly two 2
s :7, 6,5, 4, 4,3, 2,1
vertices of odd degree then G contains an Eulerian trail.
3. (a) 2
Draw four different non-isomorphic graphs of order 4. (c) Let G be a graph of order n  3. I f 2
(b) Let G1 and G2 be two graphs having the same degree sequence. 2 deg u + deg v  n
If G1 contains a vertex of degree 2 that is adjacent to a vertex of for each pair u , v of nonadjacent vertices of G , then prove that
degree 3 and a vertex of degree 4 , while G2 contains a vertex of
G is Hamiltonian.
7. (a) Prove that if a digraph D contains a closed spanning walk 2
degree 2 that is adjacent to two vertices of degree 3,then can we
then D is strong.
conclude that G1 is not isomorphic to G2 .Explain your answer. (b) Define a tournament and draw all tournaments of order 4. 2
(c) Determine whether the given pair of graphs are isomorphic or 2 (c) Prove that every vertex of a nontrivial strong tournament belongs 2
not.
to a triangle.
8. (a) There are positions open in seven different divisions of a 2
company: advertising(a),business(b), computing(c), design(d),
experimentation(e), finance(f), and guest relations(g). Six
people have applied for some of these positions, namely:
4. (a) Prove that every nontrivial tree has atleast two end 2 A: a, c, f ; B: a, b, c, d, e, g ; C: c, f ;
vertices. D: b, c, d, e, f, g ; E: a, c, f ; F: a, f ;
(b) A certain tree T of order 21 has only vertices of degree 1,3,5 and 2 Represent this situation graphically and determine whether it is
6. If T has exactly 15 end-vertices and one vertex of degree 6, possible to hire all six applicants for six different positions.
then determine the number of vertices of T having degree 5.
Page 2 of 4 page 3 of 4