A reconstruction problem related to balance equations-I

Details A reconstruction problem related to balance equations-I A reconstruction problem related to balance equations-I

2006-08-03

arxiv.org/abs/math/0608080v1

Discrete Mathematics 176 (1997) 279-284

Mathematics

Combinatorics

7 pages

Scientific paper

A modified $k$-deck of a graph is obtained by removing $k$ edges in all possible ways and adding $k$ (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 $k$-edge deck could be constructed from its modified $k$-deck. In this paper, we solve the problem when $k=1$. 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.

Affiliated with

Also associated with

No associations

Rating

A reconstruction problem related to balance equations-I does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A reconstruction problem related to balance equations-I, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A reconstruction problem related to balance equations-I will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-50815