Let D be a set of positive numbers, then the D-Euclidean distance graph (or Euclidean distance-D 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. Maehara additionally require the set D to contain the distance 1.

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