Figure 2.2: Figure 2.2 (a) An example of one graph from a family of graphs that has no Hamiltonian circuit. The number of vertices m on the left is chosen to be greater than the number of vertices n on the right. The case and is shown. (b) A graph used to model a portion of a city. Since the graph reflects the block structure of the city, it is known as a “grid graph.”