𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The number of spanning trees of the generalized Boolean n-cube network

✍ Scribed by T.-C. Huang; J.-F. Wang; C.-S. Yang; J.-Y. Lee

Book ID
108020262
Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
450 KB
Volume
16
Category
Article
ISSN
0898-1221

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

On the number of spanning trees of Kn an
On the number of spanning trees of Kn and Km, n
✍ Moh'd Z. Abu-Sbeih πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 170 KB

The object of this paper is to introduce a new technique for showing that the number of labelled spanning trees of the complete bipartite graph K,,,, is IT(m, n)l = m"-'n"-'. As an application, we use this technique to give a new proof of Cayley's formula IT(n)1 = nnm2, for the number of labelled s