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
β¦ 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 reconstruction problem related to bala
β
Bhalchandra D. Thatte
π
Article
π
1999
π
Elsevier Science
π
English
β 191 KB
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
Balance equations for micromorphic mater
β
W. Oevel; J. SchrΓΆter
π
Article
π
1981
π
Springer
π
English
β 569 KB
Charge balance equations for plutonium
β
G. L. Silver
π
Article
π
1993
π
Springer
π
English
β 150 KB
Equivalence Groups for Balance Equations
β
N.H. Ibragimov; M. Torrisi
π
Article
π
1994
π
Elsevier Science
π
English
β 282 KB