CHAPTER 6 [] Planar Graphs and Trees 6.1 PLANAR GRAPHS ¥* ‘A graph or multigraph that can be drawn in a plane or on a 6.1 The graph Ke, which isa planar graph, is usually drawn with crossing edges as shown in F graph s0 that none of its edges cross. «) ® Fig. 61 IA drawing of K, without crossing edges is shown in Fig. 6-1(b). sphere so that its edges do not cross is said to be planar. ig. 6-1(a). Draw this 62 Draw the planar graph shown in Fig. 6-2(a) so that none of its edges cross. © IA solution is shown in Fig. 62(6). 63 Draw the planar graph shown in Fig, 6.3(a) so that none of its edges cross. Ak oD Fig. 63 1 Rearrange the position of one of the vertices to obtain a solution as shown in Fig. 616) 64 Draw the planar graph shown in Fig. 64(a) so that none of its edges cross IA solution is shown in Fig. 6-4(6) 189190 0 CHAPTER 6 6s or 6 Fig. 6-4 {dentify each of the planar graphs shown in Fig. 65 as one of the following: K., Ke, Ky, Kia ly xX } CO) © Fig. 65 I Recall K, isthe complete graph with m vertices and K,, 8 the complete bipartite graph with m verses ‘connected 10 nvertics. (a) Kusince every vertex is connected to every other vertex. G@) Kuesioce itis bipare with m = Land n= 4, (@) Ky» since itis bipartite with m =2 and n = 3. Identify each of the planar graphs shown in Fig, 6-6 as one of the following: Ka, Ki, Kia, Kay: Xk oy © o Fig. 646 F(a) Kz since itis bipartite with m =n =2. (©) Kyasince iti bipartite with m= 1 and n= 4, (©) Ka since every vertex is connected to every other vertex, (a) Kus since iti bipartite with m =2 and n = 3. ‘Identify which of the graphs in Fig. 6-7 are planar. 1H Only graphs (a) and (b) are planar, i... they can be drawn so that no edges eross. [The fact that (c) and (d) ‘are not planar is not easily determined without the simple eriterion that will be developed in Section 6.4.)PLANAR GRAPHS AND TREES J 191 eH @ © Fig. 6.7 Prove that tree (Problem 5.131) isa special planar graph. I Make an induction on the number n of vertices of 7. Clearly, the unique tree T; can be realized inthe plane {Fig, 68(@)} For any T, (n> 2) choose a first-degree vertex (Problem 5.137) a8 v,. Then the graph T, ~ vs, being connected and acyl, is 8 7,-, which, by hypothesis, can be realized inthe plane [Fig.6-8(6)}. One can cbviously find a point v, of the plane such that the straight-line segment vv; does not cut 7, Ths T, can aso be realized in the plane, and the induction is complete rn (0) Tee Tos Fig. 68 62 MAPS AND REGIONS 69 * 6.0 oun Explain the term map. What sa connected map? 1A paticular planar representation of a rite planar multigraph is called a map. We say the map is connected ifthe underlying multigraph is connected. Explain what is meant by a region of « map and give an example. IA given map will divide the plane or sphere into connected areas called regions. For example, the connected imap M in Fig. 69 with six vertices and nine edges divides the plane into five regions as indicated. Define the degree of a region. I The border ofeach region r ofa map M consists ofa sequence of edges forming a closed path. The degre of the region r, denoted by dee (7), i the length ofthe closed path bordering. Sometimes the closed paths tele. If not then some edge occurs twice inthe path. For example, in Fig. 69, the borders of al the regions are eyles except for, However, if we do move counterclockwise around starting, say, athe vertex C, then wwe obtain the closed path (C, D, EF, E, C), where the edge (E, F) occurs twice192 0 CHAPTER 6 6.12” Find the degree of each region ofthe map Min Fig. 69. I The degree of a region isthe length of the closed path which borders the region. Thus dea(r)=3, deg(r)=3, deg (n)=5, deg(ry=4, deg (rs) =3 Note that deg (7s)= 5 since the path bordering rs includes the edge (F, F) twice. ‘SYerveorem 6:1: The su ofthe degrees ofthe regions of a map Mis equal to twice the mer of edges in 6.13 Prove Theorem 6.1. 1 Each edge ¢ ofthe map M either borders two regions or is contained in a region and will therefore occur twice in any path along the border of that region. Thus every edge contained in a region will be counted twice in determining the degrees of the regions of M. 6.14 Identify the cycle or closed path that borders each region of the map Q shown in Fig. 6-10. 4 5 ¢ Ee LEN e - F ¢ # Fig, 641 10 I The cycle or closed path bordering each region follows. n= (A.B, G, F, A) (cycle) = (CE, H, ©) (cycle) r= (B, C,H, D, H, G, B) (closed path) rum (A, B,C, EH, G, FA) (ste 61S Find the degree of each region of the map Q shown in Fig. 6-10 and verify Theorem 6.1. # Counting the number of edges included in each eycle or closed path idemtifed in Problem 6.14, the degree of ‘ach region is deg ir=4, dewind=6, deg(n)=3, deg (r)=7 ‘The sum of the degrees is 4+6+3+-7=20. Since @ has ten edges and 2+10=20, Theorem 6.1 is verified. 6.16 entity the cycle or closed path that borders each region of the map R shown in Fig. 1 4 = Fig. 6-11 |The cycle or closed path bordering each region follows. r= (G,C) (closed path), r,=(A, D, C, C, D, E, B, A) (closed path), m=(A, D, E, B, A) (cycle) 6.17 Find the degree of each region ofthe map R shown in Fig. 6-11 and verify Theorem 6.1. 1 Counting the number of edges included in each cyte or closed path identified in Problem 6.16, the degree of each region is deg(n)=1, deg(r)=7, degin)=4PLANAR GRAPHS AND TREES 2 193 ‘The sum of the degrees is 1+7-+4= 12. Since there are six edges in the map R and 2+ 6= 12, Theorem 6.1 is verified 618 dent the cycle or closed path that borders each region ofthe map shown in Fig 6-12 A 2 c , SS , Rip. 62 Tne eyteoreosed path bordering each region follows n=(A,D,E,A) n=(D,FE,D) n= n(GAD.C) n=(E,FE) (A, D, B, D, C, F, E, A) 6.19 Find the degree of each region of the map 5 of Problem 6.18 and verify Theorem 6.1. 1 Counting the mamber of edges of ech ofthe closed paths ented in Problem 6.18, the degree of each regions deg(n)=3, dea ()=3, den(r)=3, deg(r.)=2, deg (75) =7 ‘The sum of the degrees is 3+3+3+2+7= 18 and, since S has nine edges and thus 2+ 9 = 18, Theorem 6.1 is verified, 6.20 The two multigraphs shown in Fig. 6-13 are the same (isomorphic). However, their maps are different. For each ‘map, identify the border and the degree of each region, and verify Theorem 6.1. y Cy ® Fig. 6:13 The border for each region in Fig. 6-13(0) is n=(A,B.CA), n=(A,CB,E,D,E,A), = (A,B,E,A) Thus deg (r) = 3, deg (72) = 6, and deg (7:)=3, and $=3+6+3 = 12 which is expected as there are six edges. ‘The border for each region in Fig. 6-13(6) is n=(AB.CA) n= (A,BE,D, EA), 5=(A, CB, E,A) ‘Thus deg (r) =3, deg (rs) =5, and deg(r) =4, and $=3-45+ 2, again twice the number of edges. 621 Repeat Problem 6.20 for the two multigraphs shown in Fig. 6-14. The border for each region in Fig. 6-14(a) is n= (8,8) HA(GEC) = (A,D,E,B.B, A) n7(A,D,CE,B,A) n= (C,D,E,0)0 CHAPTER 6 @ o Fig. 6-14 ‘Thus the degrees ofthe regions are 1, 5,2,3, and 5, respectively, and S = 16 which is expected as there are eight edges. “The border for each region in Fig. 6-14(6) is n=(A,D.E,B,A) = (D,CGE.D) 5=(A,D,C.E,B,B, A) = (B,B) n= (ECE) ‘Thus the degrees of regions are 4, 1, 3,2, and 6, respectively, and, as in (a), $= 16. 6.3 EULER'S FORMULA “The mathematician Euler gave a formula which relates the number of vertices, the number of edges, and the sums of regions of any connected map. YY to 62 (Ene) Ue Me esc map wither Eee a eis Ten Verena 622 Prove Theorem 6.2 (Euler's Formula), 1 Suppose the connected map M consists ofa single vertex P as in Fig. 6-15(2). Then V = 1 and E =0, and oars ee cee.e., R= 1 Thus this case V— E+ R = 2. Otherwise M can be built up from a single ‘ertex bythe following two constructions: (Adda new verter Q. and connect it to an existing vertex Q; by an edge which doesnot cross any exiting cee, asin Fig 1508). 2) Carcet two esting vortices Q, and Q, by an edge € which does not cross any existing edge, in Fi 6-15(¢) “The tin operation does not change the value of V ~ E+ R since both V and E increased by 1, but the nunc R ofrogions is mo changed. The second operation also docs not change the vale of V— E+ R since V sant change Eis increased by 1, and itcan be shown thatthe number R of regions i also increased by 1. ‘ees ttingly, Af must have the same value of V ~ E +R asthe map consisting ofa single verte; thats, V—E4+R=2, andthe theorem is proved. pe ' a I ~~ =~ 00: | 2 ! a @ » © Fig. 615 6.23. Find the numbers V of vertices, E of edges, and R of regions of each map in Fig. 6-16, and verify Euler's formula68 6.26 PLANAR GRAPHS AND TREES 195 DH ® CO) © Fig. 616 1 Euler's formula is V- E+ R=2. Thus Figure 6-16(a): V =5, E=8, R=5, and S~845=2. Figure 6-16(6): V = 12, F=17, R=7, and 12~1747=2. Figure 6-16(c): V=3, E=6, R=5, and 3—6+5=2. Repeat Problem 6.23 for the maps in Fig. 617. LI Ww co) » © Hig. 6:17 I Euler's formulais V ~ E +R =2. Thus Figure 6-17(a): V =4, E=4, R=2, and 4—442=2. Figure 6-17(6): V=5, E=8, R= 5, and S—8+5=2. Figure 6-1%(c): V=4, E=9, R=7, and 4—9+7=2. Repeat Problem 6.23 for the maps in Fig. 6-18, eee o © Fig. 6-18 I Euler's formula is V—E +R =2. Thus Ved, E=6, R=4, and 4644-2. Figure 6-18(6): V=9, E=8, R=1, and 9—8+1=2. Figure 6-18(c): V=8, E=11, R=5, and 8 ~ 11+5=2 ‘Consider the sequence of connected maps shown in Fig. 619. Each map inthe sequence i obtained from the preceding mop by either (1) adding a vertex and connecting ito the map with an edge that does not cross any Existing edge ox (2) connecting two existing vertices with an edge that doesnot cross any existing edge Verify Euler's formula for each map inthe sequence. 1 To verify Euler's formula, determine the number of vertices, edges, and regions of each map and check that V-E+R~2 Thus Figure 61a): V=4, E=4, R=2, and $—442=2 Figure 6190): V=5, E=5, R=2,and5~5+2=2. Figure 61{¢): V5, E=6, R=3, and S—643=2196 0 CHAPTER 6 © LJ EI RIE Fig. 6-19 Figure 6-19(d): V =6, £=7, R=3, and 6-7+3=2. Figure 6-19(e): V=6, E=8, R=4, and6—84+4=2 627 Repeat Problem 6.26 for the sequence of connected maps shown in Fig. 6-20. C Fig. 620 ® ® © Determine the number of vertices, edges, and regions of each map and check that V —E+R=2. Thus Figure 6-20(a): V=3, E=2, R= 1, and3—2+1=2. Figure 6-20(6): V =3, E=3, R=2, and3-3+2=2, Figure 6-20(c): V=4, End, R=2, and4—442=2 Figure 6-20(d): V=4, E=5, R=3, and 4—5+3=2. Figure 6-20(e): V=4, E=6, R=4, and 4—64+4=2, 628 Repeat Problem 6.26 for the sequence of connected maps shown in Fig. 621. Nisdene & @ CO Fig. 621 4 Determine the number of vertices, edges, and regions and check that V— E+ R=2. Thus Figure 621(¢): V=2,£=1, R=1, and 21+ 1=2. Figure 621(b): V=2, £2, R=2. and 2-222=2, Figure 621(0): V'=3, £=3, R=2, and3—342=2. Figure 621(d): V=3, E=4, R=3,and3—443=2. Figure 6-21(e): V =3, E=5, R=4, and3-5+4=2. 629 The numberof verties and the numberof edges forfour connected planar mutgraph ae given below. Determine the number K of regions each graph must have, (@) V=10,E=14, () V=25, E=60, 6) V=6, @ Vals e=2 4 Rearranging Euler's formula, we obtain R=2~V + E. Therefore (2) R=2-10414=6, (©) R=2-25+60=37, (0) R=2-6+7=3, (d) R=2-144 131 $30 The number of vertices and the number of regions forfour connected planar multigraphs are given below: Determine the number £ of edges each graph must have.PLANAR GRAPHS AND TREES 0 197 (@) V=5,R=3, (© V=LR @) V=2,R=2, W@) V=32,R=1 I Rearranging Euler's formula, we obtain E = V +R —2. Hence (@ E=5+3-2=6, (@) E=1+8-2=7, (@) E=2+2-2=2, (i) En3+14—-2=54. 6.31 The number of edges and the number of regions for four connected planar multigraphs are given below. Determine the number V of vertices each graph must have. (@) E=6,R=3, (@ E=10,R=8, @) E=4,R=1, @) E=27, R11 I Rearranging Euler's formula, we obtain V = E ~ R +2, Thus (a) V=6-342=5, (€) V=10-8+2=4, ) Ved-142=5, @) Va=27-11+2=18 6.32 Draw three connected maps of a graph with six edges and three regions. I Three possible maps are shown in Fig. 6-22. Note that every map has V = E ~R +2=6—3+2=5 vertices as predicted by Euler's formula. Aa Pe. 6.33 Draw three connected maps of a graph with four vertices and five regions. I The possible maps are shown in Fig 623. Note that every map has E'= V+ R—2=44+5~2=7 edges as predicted by Euler's formula a iv. 634 Draw three connected maps of a graph with six vertices and seven edges. I Thxee possible maps are shown in Fig. 6-24. Note that each map has R = E- V +2=7—642=3 regions as predicted by Euler’s formula. 20 A.