K 5 , 5 is fully reconstructible in ℂ 3

Daniel Irving Bernstein,Steven J. Gortler

Discrete Applied Mathematics（2022）

引用 0|浏览2

暂无评分

摘要

A graph G is fully reconstructible in ℂ d if the graph is determined from its d-dimensional measurement variety. The full reconstructibility problem has been solved for d = 1 and d = 2. For d = 3, some necessary and some sufficient conditions are known and K 5 , 5 falls squarely within the gap in the theory. In this paper, we show that K 5 , 5 is fully reconstructible in ℂ 3.

查看译文

关键词

Graph rigidity,Distance geometry,Unlabeled reconstruction,Reconstructibility

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要