Asymptotic formulas for the enumerator of trees with a given number of hanging or internal vertices

✍ Scribed by V. A. Voblyi

Publisher: SP MAIK Nauka/Interperiodica
Year: 1977
Tongue: English
Weight: 213 KB
Volume: 21
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf02317033

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The ally-reconstruction number of a tree

The ally-reconstruction number of a tree with five or more vertices is three

✍ Wendy Myrvold 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 788 KB

## Abstract The __ally‐reconstruction number__ of a graph __G__, ally‐rn(__G__), is the minimum number of vertex‐deleted subgraphs required in order to identify __G__ up to isomorphism. In this paper, we show that ally‐rn(__T__) = 3 for any tree __T__ with five or more vertices.