Rigidity and reconstruction for graphs
Combinatorics
2016-02-01 v1 Metric Geometry
Abstract
We present measure theoretic rigidity for graphs of first Betti number b>1 in terms of measures on the boundary of a 2b-regular tree, that we make explicit in terms of the edge-adjacency and closed-walk structure of the graph. We prove that edge-reconstruction of the entire graph is equivalent to that of the "closed walk lengths".
Keywords
Cite
@article{arxiv.1601.08130,
title = {Rigidity and reconstruction for graphs},
author = {Gunther Cornelissen and Janne Kool},
journal= {arXiv preprint arXiv:1601.08130},
year = {2016}
}
Comments
9 pages