Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

On the set edge-reconstruction conjecture

Lars Dgvling Andersen1, Songkang Ding2, Preben Dahl Vestergaard1
1Department of Mathematics and Computer Science Institute of Electronic Systems Aalborg University Aalborg, Denmark
2Shanghai Maritime University Shanghai, The People’s Republic of China
  • Published: 28/02/1996

Abstract

We prove that the set edge-reconstruction conjecture is true for graphs with at most two graphs in the set of edge-deleted subgraphs.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Lars Dgvling Andersen, Songkang Ding, Preben Dahl Vestergaard. On the set edge-reconstruction conjecture[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 020. 3-9. DOI: .