𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Number of spanning trees in a wheel

✍ Scribed by Myers, B.


Book ID
118193007
Publisher
Institute of Electrical and Electronics Engineers
Year
1971
Tongue
English
Weight
334 KB
Volume
18
Category
Article
ISSN
0018-9324

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


The number of spanning trees in buckmins
✍ 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
✍ 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.

The number of spanning trees of a graph
✍ Kinkar C Das,Ahmet S Cevik,Ismail N Cangul πŸ“‚ Article πŸ“… 2013 πŸ› Hindawi Publishing Corporation 🌐 English βš– 207 KB
On the number of spanning trees in a mol
✍ R.B. Mallion πŸ“‚ Article πŸ“… 1975 πŸ› Elsevier Science 🌐 English βš– 444 KB

A rccenl theorem due to W'aller is applied to the mokculnr gmph of a typical conjugtcd system (naphthalene) in order to demonstrate the enumeration of spanning trees, on each of which a "ring current" calculation may be based.