Globally rigid graphs are fully reconstructible
Globally rigid graphs are fully reconstructible
Abstract A d -dimensional framework is a pair $(G,p)$ , where $G=(V,E)$ is a graph and p is a map from V to $\mathbb {R}^d$ . The length of an edge $uv\in E$ in $(G,p)$ is the distance between $p(u)$ and $p(v)$ . The framework is said to be globally …