Learn More
Let G = (V,E) be a simple, undirected graph. Given an integer r ≥ 1, we say that G is r-twin-free (or r-identifiable) if the balls B(v, r) for v ∈ V are all different, where B(v, r) denotes the set(More)