Scribd Logo
Carica

Benvenuto in Scribd!

  • Graph Theory Mathematics 2 Exercise

    Caricato da

    serachguru
    77 visualizzazioni11 pagine
    Graph Theory Mathematics 2 Exercise

    Copyright

    © © All Rights Reserved

    Formati disponibili

    PDF o leggi online da Scribd

    Hai trovato utile questo documento?

    Questo contenuto è inappropriato?

    Segnala questo documento
    Graph Theory Mathematics 2 Exercise

    Copyright:

    © All Rights Reserved
    Scarica in formato PDF o leggi online su Scribd
    Segnala contenuti inappropriati
    77 visualizzazioni11 pagine

    Graph Theory Mathematics 2 Exercise

    Caricato da

    serachguru
    Graph Theory Mathematics 2 Exercise

    Copyright:

    © All Rights Reserved
    Scarica in formato PDF o leggi online su Scribd
    Segnala contenuti inappropriati
    di 11
    PLO) NI Engineering Mathematics-II 5 NOE en re ete Babu Ram Engineering Mathematics-II W.B. University of Technology, Kolkata ‘aculty of Physical Sciences, anand University PEARSON —— Delhi + Chennai + Chandigarh Engineering Mathem: 4 G3) B c Q.2) D Figure 2.246(e) further increase in fiow in possible since the s in the edges (4, B) and (C, D) has been austed. Hence value (F) nition 2.126, Let N be a nctwork. A cut in Nisa ‘ition (P,P) of the set of vertices in N such that source O€ P and the sink SeP. Thus, a cut (P,P) ina network Nisa set K of es (v,w),veP,weP such that every path from ree to sink contains at least one edge from K. In . a cut does cut a directed graph into two pieces, containing the source and the other containing sink. Nothing can flow from source to sink i es of a cut are removed. We indicate a cut by ving a dashed line to partition the vertex set. As llustration, consider the network of EXAMPLE 36. The dashed line divides the vertex set into the = {0, A} and P = {C,B,D,S}. 4 G3) B fan Figure 2.247 nition 2.127. The capacity of a cut K =(P,P) 1e sum of the capacities of all edges in K and is oted by C/K) or C(P.P). For example, the capacity of the cut in Figure 2.247 is CUPP) = Coe + C yo + Cay EXAMPLE 2.109 Find the capacity of the cut, shown by dashed line, in the network shown in Figure 2.248. d (3,2) e Figure 2.248 Solution. The cut (P,P) is given by P={o,a,c}, P={d,e,f,b.S} Therefore the capacity of the given cut is CUPP) = egy Foy + Cu, = 3414357. Definition 2.128. A minimal cut is a cut having mini- mum capacity. Theorem 2.34. (The Max Flow Min Cut Theorem) A maximum flow F in a network has value equal to the capacity of a minimum cut of the network Proof: Let be any flow and K be any cut in a net- work, Since all parts of F must pass through the edges of the cut K and since C(K) is the maximum amount that can pass through the edges of K, it fol- lows that value(F) $ C(K). The equality will hold if the flow uses the full capacity of all edges in the cut K, Thus equality holds if the flow is maximum, Further, K must be a minimum capacity cut since every cut must have capacity at least equal to value (F). This completes the proof of the theorem. EXAMPLE 2.110 In the network shown in Figure 2.249, find a maximum flow. give its value and nrove that it is ies Engineering Mathem: tly, we increase the flow by 2 in the path OBS get the network with maximum flow as shown igure 2.250(f). In fact the capacities in the edges ling to the sink have been completely exhausted. Figure 2.250(f) note that value (F=2+2+2=1+4+1 check whether it is maximum flow, we appeal to ‘ flow min cut theorem. We consider the follow- cuts: Figure 2.250(g) ) K, = {0C,0B,04} with cap (K,) = Cyc + Cog + Coy = 2434257, ) K, = {OC, BC, BS. AS} with cap (Ky) = Cyc + Cge + Cas + Cas (iii) K, = {CS, BS, AS} with eap(K3) = Cos + Cas + Cys = 144415 6, (iv) K, = {OC,OB, AS, AB} with cap (K, = Coc + Con + Cas + Cae 243414157 We note that capacity of the minimum cut in 6 Hence, the maximum flow is 6. EXERCISES 1. Is there a non-empty simple graph with twice many edges as vertices? Ans, Yes. In fact if n= number of vertices 2n= number of edges, then using the formula for number of edges in a complete graph: n(n 1) _mn=1) we have 2n which yields n= 5. But in a complete graph K, the number of edges is 10. Thus the complete graph K,, which is simple by definition, has five vertices and ten edges Is the graph given below a bipartite graph? “4 5 2.251 Ans, Yes, it is a bipartite graph, where the set of vertices V has been partitioned into two subsets, V, = {vy ¥,}, Y= Oy Vy YS) But it is not a complete bipartite graph. 3. Find a formula for the number of edges in com- plete bipartite graph K,,. Ans, The m +n vertices having been divided into two subsets V, and V, containing m verti- ces and n vertices, respectively. Every vertices in V, is joined to all the n vertices in V,, Thus, the task of joining each vertex of V, to each vertex in V, can be performed in mn ways. Hence the number of edges in K,, is mn 4. A graph G has vertices of degrees 1, 4, 3, 7, and’ 5. 9, 10) Ans. Total degree of Gis 1+4+3+743+ 2.= 20 which should be twice the number of edges. Hence number of edges in G is 10. How many edges are there in an n-cube? Ans, Degree of each vertex in an n-cube in n The number of vertices in an n cube in 2" Therefore total degree of n-cube in n2". Hence the number of edges is an n-cube is =n When does the complete graph K, possess an Euler circuit? Ans, Complete graph is a connected graph. So it will have an Euler cycle if degree of cach vertex is even. . Does the graph given below have an Euler circuit? Figure 2.252 Ans, Yes. The graph is connected and degree of each vertex is even. Hence the graph pos- sesses an Euler circuit. For example, v v, ¥5¥, ¥, ¥, % is an Euler cycle: When does the complete bipartite graph K.,, contain Euler cycle? Ans, When both m and 7 are even. In such a case the degree of each vertex will be even. In seven bridges problem, was it possible for a citizen of Konigsberg to make a tour of the city and cross each bridge exactly twice? Give reasons ‘Ams. Yes, because in such a case degree of each vertex of the graph of seven bridges prob- Jem shall be even Show that the graph given below does not con- tain a Hamiltonian cycle. MMs I 13. 14 2.83 Graphs = Mo Figure 2.253 Give example of a graph that has Euler but not Hamiltonian cireuit Ans. a a p< b e Give example of a graph that has an Hamiltonian circuit but not an Euler circuit. Ans. yu Give example of a graph that has both an Euler circuit and an Hamiltonian circuit. Ans. Ky Use Dijkstra’ shortest path algorithm to find the shortest path from a to fin the graph given below Figure 2.254 Ans.67 = Engineering Mathematics-IT Find the adjacency matrix of the graph 18. Defining an isomorphism. Show that the graphs shown below are isomorphic. oy vs ¥s (Clearly, the graph G, can be drawn as) Figure 2.255 Ans. [0 1 1 0 0 Figure 2.256 oo1t Ans. Vertex set of G, is W(G,) = {a, b, ed} toot vertex set of G, is WG,) = {x,y o1rtrot Define f: MG.) + MG,) by orto fa) =y, {(b Then fis bijective. 19. Show that the graphs shown below are not Find directed graph that have the following isomorphic. Give reasons. adjacency matrix. ool) 1020 21.0 of 110 0 Ans, ut 2 Figure 2.257 Ans, Graph G, is connected whereas G, is not connected. The connected components of re oo AY A graph G has the adjacency matrix given below, Verify whether it is connected. 20. Show that the graphs shown below are not isomorphic. oo0100 A 00010 000041). » 01001 y én 00110 a le Ans. The graph Gis connected because B= A+ Graphs = 2.85 Ans. The graphs do not have same number Ans. We note that of vertices and so are not isomorphic. () dvy.v 1. Find the complement of the graph shown below. and $0 e(v,)=3 « (i) d(vy v,) = Ld. ‘ . and so e(v. (iii) d(vy v,) = and so e(v, 6 e (iv) div, v) = 3, div, v) = 2dr, v) = 1 . and so e(v, . Figure 2.259 Hence rad (G) = min {3, 2, 2, 3) = 2. The centre is {v,, v,}. Ans. The complement of the given graph is 23. Show that any graph having n vertices, 3, 4 is planar. 24. Show that the colouring of map given below requires at least three colours +2, by Jc 4 |B | Cc ad e L—@)— E|F |G f 2. Let G be a graph and V be its vertex set. Then Figure 2.261 (i) Eccentricity of ve Vis defined as Ans. Give one colour to A and D, give sec- ond colour to B, £ and G, and third colour to (ii) The radius of the graph is defined by C and F, Thus all the adjoining boundaries rad(G)=min {e(v): ve Vj have different colours ; 25. How many colours are required to paint the graph given below? e(v)=max {dlu, v): we Ve uty}. (iii) The diameter of G is defined by diam (G)=max {e(v): ve V} =max [d(u, v): we V, ve Viutv} (iv) visa central point if e(v)=rad(G). (v) The centre of G is the set of all central points ‘ind the centre of the graph given below 4 % Figure 2.262 Ans. Three. We can paint v,. v,, v, with colours C,, C,, C,. Then paint v, by C,. v, by C,, v, by C, and v, by C, v3 Me 26. For which values of m and n is the complete nan hinartite oranh Koa 5 = Engineering Mathematics-IT Ans, Number ofedges in K,, = mn. Total num- berofverticesink,, =m+ mIfk,, isatree, then number of edges in K,, should be (m+n) ~1 Hence, to be a tree f, satisfies the condition mn=(m+1)-1 or m+n=mn+l, which is satisfied if either or Let G be a graph with m vertices and n—2 or fewer edges. Show that G is not connected Ans. Suppose G is connected. The graph itself will be a tree or it can be made a tree by eliminating some edges. In either case it must have n—1 edges. But in the questions, number of edges is less than or equal to n—2 Hence G cannot be connected. Represent the weighted graph given below in the matrix form. Figure 2.263 2 14 133 Lc 2 © 4 © 4 2 © 2 & Ans. lo 2m 45 3.4 @ 4 wo 3 3 we wo 5 3 The diagonal is + ©... e° and the matrix is symmetric with respect to the diagonal. Represent the expression given below by a binary tree and obtain the prefix form and post- fix form of the expression. arb-(cKd+e)) 31 Prefix form: ~+ab~c + de Postfix form: abede + ¢/- Convert the following postfix form of a binary tree into prefix form and parenthesized infix form and usual infix form ab+e~, Ans. Prefix form: ~ + abe Parenthesized form: (a+b) © Usual infix form: a+b-e Draw a tree for the algebraic expression (x+y) (Amt Sn)? and find its prefix polish form. Ans. Using 7 for exponentiation and * for multiplication, the binary tree representing the algebraic expression is The prefix form is +48 Bay T+ 4m * Sn 232* 1+233-24=*7(2+3)3(2-4) =* (243) (2-4) +3) *(2-4) =8*(-2) 250 32. If Tdenotes exponentiation, evaluate the pol- ish form #7 4233-24 $3. Find all cut sets for the graph G given below. b f a , Figure 2.264 Ans. fc, e}; (a, b}, fa, d}}s (la, d}, {b, ch} the Sh, tes gh} th ahh: tg. os te, h},{h, g})}. Try for other cut edges 4. Find a minimal spanning tree for the graph shown below 1s Figure 2.265 36. 38, Graphs = 2.87 Ans. Find a minimal tree for the graph of Exercise 34 by deleting one by one those costliest edges whose deletion does not disconnect the graph. Ans. First remove {a, d}, then {d,c}. {a,e}, {b, e}. We cannot remove {c, €} now because the graph will be disconnected by doing so. But we can delete {, d}. Now delete any of {a,c} or {b,c}. We will get two minimal trees, Find all spanning trees of the graph shown below Figure 2.266 Ans, Each spanning tree must have 1— 4-1=3 edges, There are cight such trees Find the value of the maximum flow in the net- work of EXAMPLE 2.109 and verify the value obtained by max flow min cut theorem Ans. Value (F) for max flow=7, minimum cut (&) is shown in Figure 8.248, Find the value of the maximum flow in the net- work shown in Figure 2.267 and verify your answer using max flow min cut theorem: 4 2 B Figure 2.267 Ans, Max flow=6 Improper Integrals 3.1 IMPROPER INTEGRAL While evaluating Riemann integrals, the integrand ‘was assumed to be bounded and the range (interval) of integration was assumed to be finite. The aim of this chapter is to consider the integrals in which the above conditions are not satisfied. This leads us to a concept called the improper integral. Definition 3.1. If the integrand fis unbounded or the limits a or b or both are infinite, then the integral é | #(x)dx is called an improper integral, generalized integral or an infinite integral. For example, the integrals 1 ofs (i) J oy and 1 Git) fa ite are improper integrals. We note that in integeal (i), the integrand becomes infinite (unbounded) at the lower limit 0. In such a case, we say that x = 0 is a point of infinite discontinuity (singular point) of the integrand f- In integral (ii), both lower and upper limits are singular points of f; whereas in integral (iii), the range of integration is infinite. An integral that is not improper is called proper imegral. In view of Definition 3.1, we shall consider the following two cases: (a) When the integral is unbounded. (b) When the range of integration is infinite, 3.2 CONVERGENCE OF IMPROPER INTEGRAL WITH UNBOUNDED INTEGRAND In what follows, we assume that the number of singularities of the integrand in any interval of integration is Definition 3.2. If the lower limit is the only singularity of the integrand f, then the improper integral ® J f(x)de is said to converge at a if s tim f roux exists and is finite, EXAMPLE 3.1 ; Examine the convergence of / S 0 Solution, We note that the lower limit 0 is the only singularity of the integrand £ in the interval (0, 2]. Then ja = tim pao 0 = lim po Since the limit is not finite, the given improper inte- gral is divergent. Definition 3.3. If the upper limit is the only singularity of the integrand f, then the improper integral J f(x)de is said to converge at b if rp lim / flxjdx exists and is finite, EXAMPLE 3.2 Examine the convergence of [u (=x) 3.2 Engineering Mathematics-I1 Solution. Since the upper limit 1 is the only singular- ity of the integrand, we have 1 Ly dx lim. (loxp ete ° 0 1 = lim wos [Tx] 9 I lim |——1] =o0. ln Hence, the given improper integral is divergent. Definition 3.4. If both upper and lower limits are the only singularities of the integrand, and ¢ is any point within the interval of integration [a,b], then * the improper integral [ f(x)dx converges if both ‘ ® improper integrals [/(x)dv and J f(x)dx converge, Moreover, [reve frovae+ fra EXAMPLE 3.3 5 Examine the convergence of [ a de Solution, Both 0 and 2 are singularities of the inte- grand. Therefore, 2 1 2 0 o 1 1. x = 3 loss 1 a 0-2 ig lor] 2 1 be lim [log 20 zal 2-4 +4 lim flog>—"| +0 =o H wed Hence, the given improper integral diverges. 3.2.1 COMPARISON TESTS (A) Let f and @ be two functions such that f(x) > 0, G(x) > 0 and f(x) < (x) for all x € (a,b). Then » f (i) [ flx)dx converges if | (x)dx converges. “ » Gi) [ d(x)dv diverges if f f(x)dx diverges. Proof. Assume that f and ¢ are both bounded and integrable in the interval [a+p, b),0<"< (b —a) and a is the only singularity. Then, by the given hypothesis, ’ | fevers [ eevee we(0, b~a).(1) ne To prove (i), let | (x)dx converge so that there exists a number M such that » / x)dy

    Potrebbero piacerti anche