𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Balance equations for reconstruction problems

✍ Scribed by I. Krasikov; Y. Roditty


Book ID
112495041
Publisher
Springer
Year
1987
Tongue
English
Weight
260 KB
Volume
48
Category
Article
ISSN
0003-889X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A reconstruction problem related to bala
✍ Bhalchandra D. Thatte πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 273 KB

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 Miiller's result on the edge reconstructability of graphs. They asked if a k-edge dec

Applications of balance equations to ver
✍ I. Krasikov πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 404 KB πŸ‘ 1 views

## Abstract A graph is called __s‐vertex switching reconstructible__ (__s__‐VSR) if it is uniquely defined, up to isomorphism, by the multiset of unlabeled graphs obtained by switching of all its __s__‐vertex subsets. We show that a graph with __n__ vertices is __n__/2‐VSR if __n__ = 0(mod 4), (__n