K5,5 is fully reconstructible in C3

Daniel Irving Bernstein,Steven J. Gortler

DISCRETE APPLIED MATHEMATICS（2022）

引用 0|浏览3

暂无评分

摘要

A graph G is fully reconstructible in Cd 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 K5,5 falls squarely within the gap in the theory. In this paper, we show that K5,5 is fully reconstructible in C3.(c) 2022 Elsevier B.V. All rights reserved.

查看译文

关键词

Graph rigidity, Distance geometry, Unlabeled reconstruction, Reconstructibility

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要