“…Indeed we have a natural upper bound for the size of an s-distance set in R d , that is, |X| d+s s [2,4]. The largest cardinality of s-distance sets is known for several dimensions and s (see [7,9,12,20,23,25,26,31]). From the view point of distance sets, we want to obtain a small-dimensional representation of a graph.…”