Article contents
On the edge-reconstruction of graphs
Published online by Cambridge University Press: 17 April 2009
Extract
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1974
References
- 2
- Cited by