Question 1.52

1. Is it possible that a street network gives rise to a disconnected graph? If so, draw such a network of blocks and streets and parking meters (in the style of Figure 1.12a). Then draw the disconnected graph it gives rise to.
2. Draw a graph where every vertex has valence of at least 3 but where removing a single edge disconnects the graph.
3. In what urban settings might a road network be represented by a graph that has an edge whose removal would disconnect the graph?