Abstract
A graph X is edge-reconstructible if it is uniquely determined up to isomorphism by the set of graphs X – e obtained by deleting one, edge e. The graphs of a comparatively rich class are shown to be edge-reconstructible. This class contains all non-trivial strong products and certain lexicographic products.
Publisher
Cambridge University Press (CUP)
Reference6 articles.
1. Reconstructing graphs
2. Bemerkungen zur Ulam-Vermutung
3. [2] Dörfler W. , “Some results on the reconstruction of graphs”, Proc. Coll, infinite and finite sets, 1973 (to appear).
4. GRAPH THEORY
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A survey on edge reconstruction of graphs;Journal of Discrete Mathematical Sciences and Cryptography;2002-04
2. Graph reconstruction—a survey;Journal of Graph Theory;1977