✦ LIBER ✦

The Number of Trees

✍ Scribed by Richard Otter

Book ID: 120665671
Publisher: John Hopkins University Press
Year: 1948
Tongue: English
Weight: 944 KB
Volume: 49
Category: Article
ISSN: 0003-486X
DOI: 10.2307/1969046

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The size-Ramsey number of trees

✍ P. E. Haxell; Y. Kohayakawa 📂 Article 📅 1995 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 638 KB

The Asymptotic Number of Leftist Trees

✍ M. Drmota 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 85 KB

Thep-Bondage Number of Trees

✍ You Lu; Jun-Ming Xu 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 195 KB

The Link Component Number of Suspended T

The Link Component Number of Suspended Trees

✍ Toshiki Endo 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 216 KB

The achromatic number of bounded degree

The achromatic number of bounded degree trees

✍ Niall Cairnie; Keith Edwards 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 621 KB

The achromatic number ~b(G) of a simple graph G is the largest number of colours possible in a proper vertex colouring of G in which each pair of coiours appears on at least one edge. The problem of determining the achromatic number of a tree is known to be NP-hard (Cairnie and Edwards, 1997). In t

The number of spanning trees in buckmins

The number of spanning trees in buckminsterfullerene

✍ T. J. N. Brown; R. B. Mallion; P. Pollak; Branca R. M. de Castro; J. A. N. F. Go 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 662 KB

## Abstract The theorem of Gutman et al. (1983) is applied to calculate the number of spanning trees in the carbon‐carbon connectivity‐network of the recently diagnosed C~60~‐cluster buckminsterfullerene. This “complexity” turns out to be approximately 3.75 × 10^20^ and it is found necessary to inv