in Paper-II with effect from 2022(CBCS Scheme) Fourth Semester B.E Degree Examination GRAPH THEORY (BCS405B) TIME:03Hours Max.Marks:100 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 ~ m| ufc Oa | al Consider the following graph G. 6 |L2 | cor (What type of a graph is 6? (ii) Find the pendant vertices in 6. iii) How many components are there in G? iv) Find the minimum degree, 6(G) in G. (W) Find the average degree, d(G) of the graph G Draw two vertex disjoint subgraphs of 6 1b] Show that the number of vertices of odd depres in a graph is always even. 7 {13 [cor ‘c | Show that the maximum number of edges in a simple graph with n vertices | 7 [LS | COl nin=1) is oR | Distinguish between Complete graph and Complete Biparite graph, 6 [12 [cor 1b] Verily whether the Tollowing graphs are isomorphic or not 7| 42 | cor [I S G © | Show that a simple graph with n vertices and k components can have atmos | 7 | L3 | COL BNA EED edges Module - 2 0.3 [al By specifying the walk, draw two Euler graphs and an Unicursal graph © [m2 [coz Tall the vertices in a connected graph @ are of even degree, then show that G : | is Eulerian, 7 |43_|co2 ‘| Define Hamiltonian cycle, How many edge-disjoim Hamiltonian cycles exist |7 [11] Coo in a complete graph with 5 vertices? Draw the graph to show and specify the cycle. © scanned wth onENScmnerOR Define Hamilionian graph. By specifying the walk, draw a graph that has a Q.4 [a] Hamittonian path but does not have a Hamiltonian citcuit 6 {Li | coz ‘Show that a connected graph G has an Eulerian trail if and only if there are exactly two vertices of odd degree in G. | @ 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 to the number of edges in the digraph. Gi) Draw a complete symmetric digraph and a complete asymmetric digraph with 4 vertices. L3_ | coz 7 |L3 | coz Module ~ 3 @__ Show that the number of vertices in a binary tree is always odd. 6 [L3 [Cos | Gi) _ Find the number of pendant vertices in a binary tree of order n | Prove that a connected graph G is a tree if and only if there is one and only one [7 [3 | COS path between every pair of vertices | Show that a tree with n vertices has n — 1 edges, 7 [13 [co3 OR (@__ Show that every connected graph contains a spanning tree. , Q.6 | a} Gi) Find the number of tree branches and chords in the following graph | |L3_ | CO3 with 7 vertices and 14 edges. Define Fundamental Circuit, If G is a graph with n vertices and q edges, then find the number of fundamental circuits in the graph. Li | co3 ‘Show that for any graph G, the vertex connectivity cannot exceed the edge | connectivity and the edge connectivity cannot exceed the degree of the vertex |7 [13 | CO3 with the smallest degree in G. Module ~ 4 @ Define planar and non-planar graphs. Q.7 [al (i) _ State Kuratowski’s theorem. Draw Kuratowski’s two graphs. 6 |Li_ | cos Show that a connected planar graph with n vertices and e edges has @— n+ 2 b| regions. 7 |13_|cos 1. Draw the geometric dual of the graph G C] 2. Write down the adjacency matrix for the graph G. 7 cos - No OR T7G isa simple planar graph with at Teast three vertices, then show that @) Q8 |ales3n—6 and ii) e < 2n—4:ifG is triangle free. $ | 13 | Coa bb] @ Show that Petersen graph is non-planar. 7 [13s [cos Gi) Let G be a planar graph. Then prove that it contains a vertex of degree at most 5 | Write down the Path matrix and Circuit matrix for the given graph. 7 [iz [cos © scanned wth onENScmnerModule — 5 9 _ [aa] Prove that every tree with two or more vertices is 2-chromatic. © [13_[ Cos | Define chromatic number of a graph. Find the chromatic polynomial and|7 [LI | COs chromatic number for the given graph. ¢ | Define Matching and complete matching, Obtain two complete matching from the given graph. Li C=) Q.10 [a] Prove that an n -vertex graph is a tree if and only if its chromatic polynomial | L3 is P(A) = AQ = 1)" Dp | Define Covering and minimal covering of graph. 7 [ul [cos Obtain two minimal coverings from the given graph. rs "Wing ‘\ : . « | State and prove Five color theorem, 7 [12_[cos © scanned wth onENScmner