 The "d"-dimensional integer lattice (with unit length edges) is the maximal abelian covering graph of a graph with one vertex and "d" self-loops.The Laves graph is a cubic graph (there are exactly three edges at each vertex) and a symmetric graph (every incident pair of a vertex and an edge can be transformed into every other such pair by a symmetry of the graph).The girth of this structure is 10 — the shortest cycles in the graph have 10 vertices — and 15 of these cycles pass through each vertex.