𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Resistance Scaling and the Number of Spanning Trees in

✍ Scribed by Elmar Teufl; Stephan Wagner


Book ID
106431882
Publisher
Springer
Year
2011
Tongue
English
Weight
669 KB
Volume
142
Category
Article
ISSN
0022-4715

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

Number of spanning trees in a wheel
✍ Myers, B. πŸ“‚ Article πŸ“… 1971 πŸ› Institute of Electrical and Electronics Engineers 🌐 English βš– 334 KB
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