Rigidity and reconstruction for graphs

Research output: Contribution to journalArticleAcademicpeer-review

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
Original languageEnglish
Pages (from-to)247-262
Number of pages16
JournalJournal of Fractal Geometry
Volume6
Issue number3
DOIs
Publication statusPublished - 24 Jun 2019

Keywords

  • Graph
  • walks
  • boundary
  • Reconstruction conjecture

Fingerprint

Dive into the research topics of 'Rigidity and reconstruction for graphs'. Together they form a unique fingerprint.

Cite this