4.1, Which ofthe following graphs is/are planar? (see Figure) a a 3 [1989: 2 Marks} (@) Gionly Gland G2 © G2only @ G2andGa 42. Agraphis planarif and only if, (2) Ifdoes not contain subgraphs homeomorphic toK, and K, 5. ©) Itdoes not contain subgraphs isomorphic to K, or Ky, 5. (© Itdoes not contain subgraphs isomorphic to K, and, @ It does not contain subgraph homeomorphie to K, or Ky 5 [1990: 2 Marks} 4.3. The maximum number of possible edges in an undirected graph with ‘a’ vertices and ‘k’ components is [1991:2 Marks} {4 Anon-planar graph with minimum number of vertices has (@) edges, 6 vertices (b) Gedges, 4 vertices (© 10edges, 5 vertices @ edges, 5 vertices [1992: 1 Mark] 5 Maximum number of edges in a planar graph with n vertices is (1992: 2 Marks] Graph Theory 46 ‘The number of distinct simple graphs with upto three nodes is (@) 15 ) 10 @7 @9 [19941 Mark] Prove that in a finite graph, the number of vertices of odd degree is always even. [1995 :2 Marks} 47 48 Let G be an undirected connected graph with distinct edge weights. Let e,,,_be the edge with maximum weight and e,,, be the edge with minimum weight. Which of the following statements is false? @) Every minimum spanning tree of G must contain egg © Ife,,.i8in a minimum spanning tree, then its removal must disconnect G © Nominimum spanning treecontainse,., @ Ghas a unique minimum spanning tree [2000:2 Marks} 4.9 How many undirected graphs (not necessary connected) can be constructed out ofa given set VE {¥y, Voy one ¥,} of n vertices? n(n-1) @) @n &) wed @2? {2001 :2 Marks} 4.10 Maximum number of edges in a n-node undirected graph without selfloops is @ © no-H2 @n-1 @ m+ HO {2002 : 1 Mark] 4.11 Let G be an arbitrary graph with n nodes and k components. Ifa vertex is removed from G, the ‘number of components in the resultant graph must necessarily lie between. (@) kandn (@) k-Landk+1 ( k-landn-1 @ k+1andn-k (2003: 1 Mark] Scanned with CamScanneroo! f 4.12, How many perfect matchings are there in a complete graph of 6 vertices? () 15 @) 24 © 0 @ 4.13 AGraph G=(V, £) satisfios @2 fs o4 [2004:2Marks] I 415, How may aE oo edges? which have at least (n’ ean, swt¢, oo" "Crs0 © z _ @ #"¢, @ 2 onecy [2004 : 2 Marks] 416 What is the maximum number of edges in an acyelic undirected graph with n vertices? @n-1 On @n4+1 @ 2n-1 [17-2004 : 1 Mark] 4.17 Whatis the number of vertices in an undirected connected graph with 27 edges, 6 vertices of degree 2, 3 vertices of degree 4 and remaining of degree 3? @) 0 ou oO @ 19 [1T-2004 : 2 Marks] 12003: 2 Marks} The min-degree of G is defined shs on n labeled vertices exist feat are ar ember oH oso 419 Which one of the following graphs ; 119 Nor plannar? Ifall the edge weights of an undirected gray are positive, then any subset of edges connects all the vertices and has minimum total weight isa (@) Hamiltonian cycle (b) Grid © Hypercube @ Tree a [IT-2006 : 1 Marky Consider the undirected graph G defined as follows, The vertices of G are bit strings oflength zn. We have an edge between vertex u and vertex, vif and only if u and v differ in exactly one bit position (in other words, v can be obtained from u by flipping a single bit). The ratio of the chromatic number of G to the diameter of Gis, 421 @ ver) () Un © 2n @ an UT-2006 : 2 Marks] Common Data for Q.4.22 & Q.4.24 ‘The 2" vertices of graph G correspond to all subsets of asetofsizen, forn> 6. Twovertices of G are adjacent ifand only ifthe corresponding sets intersect in exactly two elements. 422 The number of vertices of degree zero in Gis @1 wn | @nt1 @r | [2006 : 2 Marks] Scanned with CamScanner[2006:2 Marks] -Gbe the non-planar graph with the minimum ible number of edges. Then G has -() Sedges and 5 vertices (b) Sedges and 6 vertices Wedges and 5 vertices Wedges and 6 vertices [2007:1 Mark] der the DAG with V = (1, 2, 3, 4, 5, 6), below: : 3 6 "Which of the following is NOT a topological ordering? @ 123456 @ 132456 ) 132465 @ 324165 [2007: 1 Mark] 427 Which ofthe following graphs has an Bulerian circuit? @ Any K-regular graph where k is an even number © Acomplete graph on 90 vertices (© The complement of aeycle on 25 vertices (@ None ofthe above [2007:2 Marks} 4.28 What is the size of the smallest MIS (Maximal Independent Set) ofa chain of nine nodes? E @5 o4 ©8 @2 (17-2008 : 1 Mark] 4,29 What is the chromatic number of the following graph? 430 4.32 433 4.34 EASY | Discrete and Engineering Mathematics 16 ‘The maximum degree of a vertex in Gis 112) via ole we = OKs 2 [2006 : 2 Marks] Thi ber of conn: 01 i Be mene of connected components in @2 03 An nae 4 5 om @2n {IT-2008 : 1 Mark] G is a simple, connected, undirected graph. ‘Some vertices of G are of odd degree. Add a node vtoG and make it adjacent to each odd degree vertex of G. The resultant graph is sure to be (0) Regular () Complete (© Hamiltonian (@) Euler (17-2008 : 2 Marks} ‘What is the chromatic number of an n-vertex simple connected graph which does not contain any odd length cycle? Assume n22. @2 3 @n-1 @n (2009: 1 Mark] Which one of the following is TRUE for any simple connected undirected graph with more than 2 vertices? (a) No two vertices have the same degree (© Atleast two vertices have the same degree (©) Atleast three vertices have the same degree (@ Allvertices have the same degree {2009: 1 Mark] LetG =(V, E)bea graph. Define &(G) = iy xd, a where i is the number of vertices of degree d in G.1£S and T are two different trees with &(S)= (1), then. @ | © SFM 2010: 1 Mark] Inabinary tree with n nodes, every node hasan odd number of descendants. Every node is considered tobe its own descendant, What isthe number of nodes in the tree that have exactly onechild? @0 @ @-D2 @1 @n-1 [2010:1 Mark] Scanned with CamScannerez} 4.35 ‘The degree sequence of a simp! is ile graph is the ‘sequence of the degrees of the nodes in the graph in deening order. Which ofthe allowing ences can not be the dey ol satin 1 degree sequence of any L 7,6,5,4,4,3,2,1 IL 6, 78,5, 4,4,3,2, 6,6, 6, 3, 3, 2, 2 TIL7, 6,6, 4, 4,3, 2,2 1V.8, 7, 7,6, 4,2, 1,1 (@ Tend @) Mand @ Wonly @ Mandiv (2010: 2Marks} re graphs with the following 436 K, and __ structures: . Which one ofthe following statements is TRUE in relation to these graphs? @ K, is planar while Q, is not () Both K, and Q, are planar © Qisplanar while K, is not 4 ither K, nor Q, is planer ae [2010:2Marks) a planar graph on 487 Let G be a simple undirectes t Gis a connected ~ 10 vertices with 16 edges. If . graph, then the number of bounded faces in any embedding of Gon the plane is equal to @3s o4 @5 @é (2012:1 Mark] 4.88. Which ofthe following graphs is isomorphic to eG ni AG [2012:2 Marks] 439 Let G be a complete undirected graph on 6.vertices. If vertices of G are labeled, then the umber of distinct cycles of length 4 in G is equal to 444 Anordered n-tuple (dy, d,,...,d,) with d,2d,2__ GATE Previous Years Solved Papert: SI. | MADE ” @ 15 (300 @% " random graph of 440 Conidae nt tere vertices. vie pair of vertices 83° What tween : bers of unordered eycles ofl expected mu three? 1 os @7 wi 2 graph? —_ Tedd degree vertices is even, fall vertices is even, @® Qonly (@ Neither PnorQ [2013:1M ‘gan Which of the £1 forundirect fumber o sum of degrees @ Ponly (© Both Pand Q a directed rath where ‘cos and B the set of edges. Then thes te following graphs has the san wrongly connected components.asG? (@ G,=(V,E) where By =unluveR & G,=(V, B) where Ey (uw) owe Be © G,=(V, By) where Ey= two there is apath oflength <2 from u to vin B} @ G,= (Vy B) where V, is the set of veticesin Gwhich are not isolated [2014 (Set-1):1 443. Consider an undirected graph G where self are not allowed. The vertex set of Gis {(,j 1is a bridge (Acique is any complete subgraph of a graph) (@ A graph with bridges cannot have a cycle [2015 (Set-2) :2 Marks) Consider a binary tree T'that has 200 leaf nodes. Then, the number of nodes in Tthat have exactly two children are__. [2015 (Set-3) :1 Mark] Let G be connected undirected graph of 100 vertices and 300 edges. The weight ofa minimum spanning tree of G is 500. When the weight of each edge of G is increased by five, the weight of a minimum spanning tree becomes _. [2015 Get-8):2 Marks} ‘The minimum number ofcolours that is sufficient to vertex-colour any planar graphis___. [2016 (Set-2): 1 Mark] Let Te a tree with 10 vertices. The sum of the degrees of all the vertices in T is [2017 (Get-1): 1 Mark] G is an undirected graph with n vertices and 25 edges such that each vertex of G has degree at least 3, Then the maximum possible value of nis [2017 (Set-2):1 Mark}, ‘The chromatic number of the following graphis (2018: 1 Mark] Scanned with CamScanner —641 4.69. Let G be a graph with 100! verticen, with each vertex labelled by a distinct permutation of the numbers 1, 2,...... 100, The an edge between vertices wand v if and only if the label of u can be obtained by swapping two adjacent numbera in the label of v, Let y denote the degree of a vertex in Gand 2 denote the number of connected components in G. ‘Then, y + 102 = EEEEEN crap Theory 41 © 42° @) 44 () 46 (0) 48 12018: 2 Marks] © 413 @) 4.14 (e) 415 (d) 4.16 (a) 4.17 @) (422 (0) 4.23 (c) 424 (b) 425 (b) 4.26 432 (b) 4.33 (c) 4.34 (a) 4.35 (d) 442 (b) 444 (c) 448 (©) par EN S01! G, is ky which is a well-known non-planar graph. Gy @ Graph G, is isomorphic to the following graph: he above graph is planar. So G, is planar. G: Ee sol. t Bo jolved Papers: I | GATE Previous 4.60 Let G be an undirected complete g vertices, where n> 2. Then, the different Hamiltonian cycles in Gis (@nt © (a- ot 49 (ad) 4.10 (b) 4.18 (b) 4.19 (a) 427 (0) 428 4.36 (b) 4.37 449 (a) 451 G, is isomorphic to K,, . which is well k non-planar graph. Therefore, Gy isa graph. ai Kuratowski’s theorem: A graph is planar and only if, it does not contain subgr homeomorphic to K, or K, ‘The maximum number of possible edges in an_ undirected graph with “a” vertices and “k’ | components is ee). K, is smallest non-planar graph in terms number of vertices. The number of vertices in K, is 5 and numberof edges in K, is a =10. Maximum number of edges in a connected, planar, simple graph with n vertices is 3n—6. Scanned with CamScanner