AbstractA d-dimensional framework is a pair (G, p), where $$G=(V,E)$$
G
=
(
V
,
E
)
is a graph and p is a map from V to $$\mathbb {R}^d$$
R
d
. The length of an edge $$uv\in E$$
u
v
∈
E
in (G, p) is the distance between p(u) and p(v). The framework is said to be globally rigid in $$\mathbb {R}^d$$
R
d
if every other d-dimensional framework (G, q), in which the corresponding edge lengths are the same, is congruent to (G, p). In a recent paper Gortler, Theran, and Thurston proved that if every generic framework (G, p) in $$\mathbb {R}^d$$
R
d
is globally rigid for some graph G on $$n\ge d+2$$
n
≥
d
+
2
vertices (where $$d\ge 2$$
d
≥
2
), then already the set of (unlabeled) edge lengths of a generic framework (G, p), together with n, determine the framework up to congruence. In this paper we investigate the corresponding unlabeled reconstruction problem in the case when the above generic global rigidity property does not hold for the graph. We provide families of graphs G for which the set of (unlabeled) edge lengths of any generic framework (G, p) in d-space, along with the number of vertices, uniquely determine the graph, up to isomorphism. We call these graphs weakly reconstructible. We also introduce the concept of strong reconstructibility; in this case the labeling of the edges is also determined by the set of edge lengths of any generic framework. For $$d=1,2$$
d
=
1
,
2
we give a partial characterization of weak reconstructibility as well as a complete characterization of strong reconstructibility of graphs. In particular, in the low-dimensional cases we describe the family of weakly reconstructible graphs that are rigid but not redundantly rigid.
Alternating Turing machines and the analytical hierarchy
