A Cantor-Bendixson Rank for Siblings of Trees
Similar to topological spaces, we introduce the Cantor-Bendixson rank of a tree T by repeatedly removing the leaves and the isolated vertices of T using transfinite recursion. Then, we give a representation of a tree T as a leafless tree T∞ with some leafy trees attached to T∞. With this representat...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Australian National University
2023
|
| Online Access: | View Fulltext in Publisher View in Scopus |
| LEADER | 01039nam a2200145Ia 4500 | ||
|---|---|---|---|
| 001 | 10.37236-11537 | ||
| 008 | 230529s2023 CNT 000 0 und d | ||
| 020 | |a 10778926 (ISSN) | ||
| 245 | 1 | 0 | |a A Cantor-Bendixson Rank for Siblings of Trees |
| 260 | 0 | |b Australian National University |c 2023 | |
| 856 | |z View Fulltext in Publisher |u https://doi.org/10.37236/11537 | ||
| 856 | |z View in Scopus |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-85159705417&doi=10.37236%2f11537&partnerID=40&md5=23a1dbaab94850fa17a73fe7d1d5d2a0 | ||
| 520 | 3 | |a Similar to topological spaces, we introduce the Cantor-Bendixson rank of a tree T by repeatedly removing the leaves and the isolated vertices of T using transfinite recursion. Then, we give a representation of a tree T as a leafless tree T∞ with some leafy trees attached to T∞. With this representation at our disposal, we count the siblings of a tree and obtain partial results towards a conjecture of Bonato and Tardif. © Davoud Abdi. | |
| 700 | 1 | 0 | |a Abdi, D. |e author |
| 773 | |t Electronic Journal of Combinatorics | ||