Distance hereditary graphs G of connectivity two or three and diam(G) = diam(G̅) = 3 are reconstructible
2019
A graph is said to be reconstructible if it is determined up to isomorphism from the collection of all its one-vertex deleted unlabeled subgraphs. It is shown that all distance hereditary graphs G of connectivity two or three and diam(G) = diam(G) = 3 are reconstructible.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
6
References
0
Citations
NaN
KQI