Institute of Technical Education & Research, SOA University

(b) Draw the Petersen graph and determine whether it has a 1-factor 2
or not.
(c) Prove that the Peterson graph is not 1-factorable. 2 END SEMESTER EXAMINATION, APRIL-2018
INTRODUCTORY GRAPH THEORY (CSE 1004)
9. (a) State and prove the Euler’s Identity. 2

(b) Show that K 3,3 is nonplanar. 2 Programme: B.Tech Semester: 2nd

Full Marks: 60 Time: 3 Hours
(c) Determine whether the given graph is planar or nonplanar. 2
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
L1, L3,L3 7(a),7(b),7(c) 2,2,2
of graphs.
10 (a) Define the chromatic number of a graph and determine the 2 Discuss and analyze the isomorphism of L3, L3, 3(a),3(b), 2,2,
. chromatic number of the graph Cn . graphs. L3 3(c) 2
Define bridges, trees, spanning trees and L3, L3, 4(a),4(b), 2,2,
(b) Prove or disprove the following statement: 2
study its various concepts and apply the L3 4(c) 2
‘If it can be shown that there is no 3-coloring of a graph G ,
Kruskal’s and Prim’s algorithms to find the
then  (G ) = 4 .’
minimum spanning tree of a connected
(c) Eight chemicals c1 , c2 ,......, c8 are to be shipped by air. The cost 2 weighted graph.
of shipping one container is $125. For each additional container Define cut-vertices, blocks and analyze the L2, L3, 5(a),5(b), 2,2,
the cost increases by $85. Some chemicals interact with one connectivity of graphs. L3 5(c) 2
another and cannot be shipped in the same container. The Define Eulerian and Hamiltonian graphs and L2, L3, 6(a),6(b), 2,2,
chemicals that interact with a given chemical are given as study its various properties and applications. L3 6(c) 2
follows. Define and discuss matchings and L3, L3, 8(a),8(b), 2,2,
factorization of graphs and study its L3 8(c) 2
c1 : c2 , c5 , c6 c2 : c1 , c3 , c5 , c7 c3 : c2 , c4 , c7 applications.
Discuss and analyze planar graphs and study its L3, L3, 9(a),9(b), 2,2,
c4 : c3 , c6 , c7 , c8 c5 : c1 , c2 , c6 , c7 , c8 c6 : c1 , c4 , c5 , c8 L3, L3, 9(c),10(a), 2,2,
various applications as well as discuss graph
c7 : c2 , c3 , c4 , c5 , c8 c8 : c4 , c5 , c6 , c7 coloring and its application to scheduling L3, L3 10(b),10(c) 2,2
problems.
Determine the minimum cost of shipping the chemicals and how
*Bloom’s taxonomy levels: Knowledge (L1), Comprehension (L2), Application
should the chemicals be packed into containers? (L3), Analysis (L4), Evaluation (L5), Creation (L6)
*End of Questions* Answer all questions. Each question carries equal mark.

1. (a) Define a connected graph and give an example of a connected 2

graph G whose complement G is also connected.

Page 4of 4 ` page 1 of 4

 (b) Let R be the relation defined on the vertex set of a graph G by 2 (c) Determine all spanning trees of the graph G . 2
u R v , where u , v V (G ) , if u is connected to v , that is, if G
contains a u − v path. Then show that R is an equivalence
relation.

(c) For the graphs G = K 5 and H = K 3 , draw G + H and G  H . 2

2. (a) The degree of each vertex of a certain graph of order 12 and size 2 5. (a) Give a counterexample to the following statement. 2
31 is either 4 or 6. Determine the number of vertices in the graph ‘If G is a connected graph with a cut- vertex, then G contains a
having degree 4. bridge.’
(b) Construct r-regular graphs of order 6 for all possible values of r. 2 (b) Determine the cut-vertices, bridges and blocks of the given 2
graph.
(c) If the sequence x, 7, 7,5,5, 4,3, 2 is graphical, then determine 2
the possible values of x(0  x  7) .
3. (a) Draw all non-isomorphic graphs of order 3. 2

(b) Let G1 and G2 be two graphs having the same degree sequence. 2
If G1 contains a vertex of degree 2 that is adjacent to a vertex of (c) Prove that for every positive integer n,  ( K n ) = n − 1 . 2
degree 3 and a vertex of degree 4 , while G2 contains a vertex of 6. (a) Define an Eulerian graph and a Hamiltonian graph and give an 2
degree 2 that is adjacent to two vertices of degree 3, then can we example of a graph which is Hamiltonian and has an Eulerian
conclude that G1 is not isomorphic to G2 . Explain your answer. trail but is not Eulerian.
(b) Prove that if a nontrivial connected graph G is Eulerian, then 2
(c) Determine whether the given pair of graphs are isomorphic or 2 every vertex of G has even degree.
not. (c) Let G be a graph of order n  3 . If deg v  n / 2 for each vertex v 2
of G , then prove that G is Hamiltonian.
7. (a) State the First Theorem of Digraph Theory. 2
(b) If every vertex of some tournament of order n has the same 2
outdegree x , then determine x .
(c) Prove that every tournament contains a Hamiltonian path. 2
4. (a) Prove that every tree of order n has size n − 1. 2 8. (a) Six students A, B, C, D, E and F are to receive complimentary 2
books in either algebra(a), calculus(c), differential equations(d),
(b) A tree of order 35 has 25 vertices of degree1, two vertices of 2 geometry(g), history of mathematics(h), programming(p) or
degree 2, three vertices of degree 4, one vertex of degree 5 and topology(t). The preferences of the students are given as follows:
two vertices of degree 6. It further contains two vertices of the A: d, h, t ; B: g, p, t ; C: a, g, h ;
same unknown degree x . Determine x . D: h, p, t ; E: a, c, d ; F: c, d, p ;
Determine whether each of the students can receive a book of
his or her preference.

Page 2 of 4 page 3 of 4