you just need to create the graphs

so you just don't know how to do it

Exercise 4. Suppose that G and H each have Hamilton circuits. Construct a new graph as follows: select adjacent vertices in G, a and b, and adjacent vertices in H, d' and W. Then include new edges (a, a') and (6,6). Show that, regardless of the choice of adjacent vertices in each graph, the new graph has a Hamilton circuit. Then provide an example demonstrating that this is not necessarily true if the vertices chosen in even one of the graphs are not adjacent. Exercise 4. Suppose that G and H each have Hamilton circuits. Construct a new graph as follows: select adjacent vertices in G, a and b, and adjacent vertices in H, d' and W. Then include new edges (a, a') and (6,6). Show that, regardless of the choice of adjacent vertices in each graph, the new graph has a Hamilton circuit. Then provide an example demonstrating that this is not necessarily true if the vertices chosen in even one of the graphs are not adjacent