A reconstruction problem related to balance equations-II: the general case
| dc.creator | Thatte, Bhalchandra D. | |
| dc.date | 2005-12-06 | |
| dc.date.accessioned | 2026-07-07T06:54:54Z | |
| dc.date.available | 2026-07-07T06:54:54Z | |
| dc.description | A modified $k$-deck of a graph $G$ is obtained by removing $k$ edges of $G$ in all possible ways, and adding $k$ (not necessarily new) edges in all possible ways. Krasikov and Roditty asked if it was possible to construct the usual $k$-edge deck of a graph from its modified $k$-deck. Earlier I solved this problem for the case when $k=1$. In this paper, the problem is completely solved for arbitrary $k$. The proof makes use of the $k$-edge version of Lovász's result and the eigenvalues of certain matrix related to the Johnson graph. This version differs from the published version. Lemma 2.3 in the published version had a typo in one equation. Also, a long manipulation of some combinatorial expressions was skipped in the original proof of Lemma 2.3, which made it difficult to follow the proof. Here a clearer proof is given. | |
| dc.description | Improved version of Discrete Mathematics 194, no. 1-3(1999) 281-284 | |
| dc.identifier | https://arxiv.org/abs/math/0512120 | |
| dc.identifier | http://arxiv.org/abs/math/0512120 | |
| dc.identifier | Discrete Mathematics 194, no. 1-3(1999) 281-284 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/106104 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C60 | |
| dc.title | A reconstruction problem related to balance equations-II: the general case | |
| dc.type | text |