2.7 For the graph shown on the right, write down: (2) awalk of length 7 between u and w; (b) all the cycles of lengths 1, 2, 3 and 4; (9. apath of maximum length. 28 Draw four connected graphs, Gy, Gz, G3 and Gy, each with 5 vertices and 8 edges, satisfying the following conditions: Gris a simple graph; Gis a non-simple graph with no loops; Ggis a non-simple graph with no multiple edges Gy is a graph with both loops and multiple edges. 29 (a) Draw asimple connected graph with degree sequence (1,2, 3,3,4,4, 6). (b) Draw a simple connected graph with degree sequence (3,3,3,3,3,5,5,5). Regular and Bipartite Graphs 2.10 Draw: (2) two non-isomorphic regular graphs with 8 vertices and 12 edges; (b) twonon-isomorphic regular graphs with 10 verticesand 20 edges. 2.11 Determine the number of edges of each of the following graphs: @ Ci) Koie ©) Ko (@) Qs (©) the dodecahedron.58 212 213 Graphs and Applications: An Introductory Approach The complement of a simple graph G is obtained by taking the vertices of G and joining two of them whenever they are uot joined in G. a simple graph G complement of G (a) Verify that the complement of P4 is Py. (b) Whatis the complement of Ki? of K3,3? of C5? (c) Show that, if a simple graph G is isomorphic to its complement, then the number of vertices of G has the form 4k or 4k + 1, forsome positive integer k. (4) Find all the simple graphs with four or five vertices that are isomorphic to their complements. (e) Construct a graph with eight vertices that is isomorphic to its complement. The girth of a graph G is the length of a shortest cycle in G, and the circumference of G is the length of a longest cycle in G. Find the girth and circumference of: (a) the Petersen graph; —(b)_ the 4-cube graph Qy.Case Studies Four Cubes Problem 2.16 Show that the subgraphs Hy and i of the graph Gshown below are the only pair of subgraphs possessing the following properties forthe given set of cubes: (@) each contains exactly one edge from the graph foreach cube; (©) they have no edgesin common; (6) each verteris incident with two edges. ae s 7 ca © ® elyle ely fale Rg ¥ cube cubed Hint First show that neither subgraph can contain the loop at R, then repeat the process for the loop at G, and then for the edge joining R and Y. 2.17 Show that thereis no solution to the four cubes problem for the following set of cubes: € 2 ylelele elelayy e{yfele ¥felele R ¢ ¥ cube! cube? cube cubed