Author:
Arjomandi E.,Corneil D. G.
Abstract
Ulam in [7] has conjectured that any graph G with p≥3 nodes is uniquely reconstructable from its collection of subgraphs Gi=G-vi, i=1,2, … p. This conjecture has been proved for various finite graphs including regular, Eulerian, unicyclic, separable, trees and cacti. Since Ulam′s conjecture seems difficult to prove or disprove, some authors have tried to strengthen the conjecture [3]. One of these stronger conjectures is Harary′s conjecture [2].
Publisher
Canadian Mathematical Society
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The Reconstruction Problem;Discrete Mathematics and Its Applications;2013-11-26
2. Graph reconstruction—a survey;Journal of Graph Theory;1977
3. On reconstructing graphs from their sets of subgraphs;Journal of Combinatorial Theory, Series B;1976-10