𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Note on Finding the Shortest Spanning Tree Of a Graph by Programmable Methods

✍ Scribed by Trevor R. Fietz

Book ID
109147477
Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
194 KB
Volume
8
Category
Article
ISSN
0016-7363

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the number of spanning trees in a mol
On the number of spanning trees in a molecular graph
✍ 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.