Ara
Toplam kayıt 1, listelenen: 1-1
Stronger reconstruction of distance-hereditary graphs
(Işık University Press, 2021)
A graph is said to be set-reconstructible if it is uniquely determined up to isomorphism from the set S of its non-isomorphic one-vertex deleted unlabeled subgraphs. Harary’s conjecture asserts that every finite simple ...