Article ID Journal Published Year Pages File Type
8902937 Discrete Mathematics 2018 6 Pages PDF
Abstract
A graph is reconstructible if it is determined up to isomorphism from the collection of all its one-vertex deleted unlabelled subgraphs. It is shown that all distance hereditary 2-connected graphs G such that diam(G)=2 or diam(G)=diam(G¯)=3 are reconstructible.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Reconstruction of distance hereditary 2-connected graphs
Authors
, ,