 The edges of the Laves graph connect pairs of points whose Euclidean distance from each other is (these pairs differ by one unit in two coordinates, and are the same in the third coordinate).The other non-adjacent pairs of vertices are farther apart, at a distance of at least from each other.The edges of the resulting geometric graph are diagonals of a subset of the faces of the regular skew polyhedron with six square faces per vertex, so the Laves graph is embedded in this skew polyhedron.