A characterization in \(\mathbb{Z}^ n\) of finite unit-distance graphs in \(\mathbb{R}^ n\)
A unit-distance graph in \(\mathbb{R}^ n\) is a graph with a subset of \(\mathbb{R}^ n\) as the vertex set and two vertices adjacent only if their Euclidean distance is 1. It is shown that a finite graph \(G\) on \(m\) vertices is isomorhpic to a unit-distance graph in \(\mathbb{R}^ n\) if and only if there exists a real number \(\lambda\) and for arbitrarily large integers \(r\) the graph \(G\) can be drawn in the \(n\)-dimensional integer lattice \(\mathbb{Z}^ n\) such that (i) the distance between every pair of vertices is at least \(\lambda r\), and (ii) adjacent vertices have their distance in the closed interval \([r- g(r), r+ g(r)]\) with \(g(r)= 2\sqrt n/r^{1/nm}\). In the case of the Euclidean plane two variations of this result are proved.
scientific article; zbMATH DE number 562390