Abstract
The edge reconstruction conjecture of Harary (1964) states
that a finite graph G can be reconstructed up to isomorphism from
the multiset of its edge-deleted subgraphs G − e (with e running over
the edges of G). We put this conjecture in the framework of measuretheoretic rigidity, revealing the importance of the lengths of labeled
closed walks for the problem
that a finite graph G can be reconstructed up to isomorphism from
the multiset of its edge-deleted subgraphs G − e (with e running over
the edges of G). We put this conjecture in the framework of measuretheoretic rigidity, revealing the importance of the lengths of labeled
closed walks for the problem
Original language | English |
---|---|
Pages (from-to) | 247-262 |
Number of pages | 16 |
Journal | Journal of Fractal Geometry |
Volume | 6 |
Issue number | 3 |
DOIs | |
Publication status | Published - 24 Jun 2019 |
Keywords
- Graph
- walks
- boundary
- Reconstruction conjecture