Distance hereditary graphs G of connectivity two or three and diam(G) = diam(G̅) = 3 are reconstructible

P. Devi Priya () and S. Monikandan ()
Additional contact information
P. Devi Priya: Manonmaniam Sundaranar University
S. Monikandan: Manonmaniam Sundaranar University

Indian Journal of Pure and Applied Mathematics, 2019, vol. 50, issue 2, 477-484

Abstract: Abstract 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.

Keywords: Reconstruction; distance; connectivity; distance hereditary graphs (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13226-019-0339-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:indpam:v:50:y:2019:i:2:d:10.1007_s13226-019-0339-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/13226

DOI: 10.1007/s13226-019-0339-2

Access Statistics for this article

Indian Journal of Pure and Applied Mathematics is currently edited by Nidhi Chandhoke

More articles in Indian Journal of Pure and Applied Mathematics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().