Rigidity and reconstruction for graphs
Gunther Cornelissen
Universiteit Utrecht, NetherlandsJanne Kool
Max-Planck-Institut für Mathematik, Bonn, Germany
![Rigidity and reconstruction for graphs cover](/_next/image?url=https%3A%2F%2Fcontent.ems.press%2Fassets%2Fpublic%2Fimages%2Fserial-issues%2Fcover-jfg-volume-6-issue-3.png&w=3840&q=90)
Abstract
The edge reconstruction conjecture of Harary (1964) states that a finite graph can be reconstructed up to isomorphism from the multiset of its edge-deleted subgraphs (with running over the edges of ). We put this conjecture in the framework of measure-theoretic rigidity, revealing the importance of the lengths of labeled closed walks for the problem.
Cite this article
Gunther Cornelissen, Janne Kool, Rigidity and reconstruction for graphs. J. Fractal Geom. 6 (2019), no. 3, pp. 247–262
DOI 10.4171/JFG/76