𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithmic approach to the number of spanning trees in Buckminsterfullerene

✍ Scribed by P. E. John; R. B. Malllon

Publisher
Springer
Year
1994
Tongue
English
Weight
756 KB
Volume
15
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

The number of spanning trees of a graph
The number of spanning trees of a graph
✍ Jianxi Li; Wai Chee Shiu; An Chang πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 387 KB

In this paper, we present some sharp upper bounds for the number of spanning trees of a connected graph in terms of its structural parameters such as the number of vertices, the number of edges, maximum vertex degree, minimum vertex degree, connectivity and chromatic number.