A reconstruction problem related to balance equations
From MaRDI portal
(Redirected from A reconstruction problem related to balance equations)
Abstract: A modified -deck of a graph is obtained by removing edges in all possible ways and adding (not necessarily new) edges in all possible ways. Krasikov and Roditty used these decks to give an independent proof of M"uller's result on the edge reconstructibility of graphs. They asked if a -edge deck could be constructed from its modified -deck. In this paper, we solve the problem when . We also offer new proofs of Lov'asz's result, one describing the constructed graph explicitly, (thus answering a question of Bondy), and another based on the eigenvalues of Johnson graph.
Recommendations
Cites work
- A note on the line reconstruction problem
- Balance equations for reconstruction problems
- Graph reconstruction—a survey
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- The edge reconstruction hypothesis is true for graphs with more than n _2\,n edges
- Vertex-switching reconstruction of subgraph numbers and triangle-free graphs
This page was built for publication: A reconstruction problem related to balance equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377699)