Figure 7
(a) A 4V2 unit-distance graph in which the 1–2 and 1–1 (2–2) edges are of different length; (b), (c) the unit-distance graph in (a) in which vertices 1 and 2 are moved towards each other to reduce the difference in edge lengths; (d) the unit-distance graph in (a) in which vertices 1 and 2 are moved to the same position to make the edge lengths the same. Note how the 1–2 and 1–1 (2–2) edges cannot be equal until θ = 0° and vertices 1 and 2 occupy the same position, and thus this unit-distance graph is non-equalizable in 2D. Colouring and labelling are explained in Section 4.2.1. |