Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set {(x, y):d(x, y) element D}, where d(x, y) is the Euclidean distance between vertices x and y.

distance k-graph | graph distance | prime-distance graph | unit-distance graph | unit neighborhood graph