Abstract
A rooted tree is ℓ-reconstructible if it is determined by its multiset of rooted subtrees (with the same root) obtained by deleting ℓ vertices. We determine which rooted trees are ℓ-reconstructible for ℓ ≤ 3 and show how this can be used to study reconstructibility of unrooted trees.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 2479-2509 |
| Number of pages | 31 |
| Journal | Pure and Applied Mathematics Quarterly |
| Volume | 18 |
| Issue number | 6 |
| DOIs | |
| State | Published - 2022 |
Keywords
- Reconstruction Conjecture
- rooted tree
- ℓ-reconstructibility
ASJC Scopus subject areas
- General Mathematics
Fingerprint
Dive into the research topics of '3-reconstructibility of rooted trees'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS