A graph G = ( V , E ) is globally rigid in R d if for any generic placement p : → of the vertices, edge lengths u − v ∈ uniquely determine up to congruence. In this paper we consider minimally graphs, which deletion an arbitrary destroys global rigidity. We prove that on at least + 2 then | ≤ 1 . This implies minimum degree most also show only upper bound number edges attained complete K It fol...