2000 character limit reached
Rigidity and reconstruction for graphs (1601.08130v1)
Published 29 Jan 2016 in math.CO and math.MG
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".
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.