Distinct distance sets in a graph (Q1182889)

The authors introduce the concept of a distinct distance set (\(DD\) set) for a graph \(G\) as a vertex subset \(S\) of \(V(G)\) with the property that for \(s=| S|\) there are \(s\choose 2\) distinct distances for the pairs of vertices in \(S\). Considering the maximum size of a \(DD\) set for \(G\) --- denoted by \(DD(G)\) --- they want to determine certain classes of graphs \(G\) with the property that \(DD(G)=k\in\mathbb{N}\). They can completely settle this problem in case of bipartite graphs. Finally, the two authors deal with the set of \(m\)-dimensional grid graphs and define the notion of an \(m\)-fold numbering and give certain \(m\)-fold labellings of grid graphs and complete graphs. They conclude their paper by giving some remarkable conjectures. At the end of this brief review I'd like to mention that this note is very well legible because the authors explain the relationship between their \(DD\) problem and the Golomb ruler and graceful numberings of \(K_ n\) in an excellent way.