𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Calculating the characteristic polynomial, eigenvectors and number of spanning trees of a hexagonal system

✍ Scribed by John, Peter; Sachs, Horst

Book ID
111963651
Publisher
Royal Society of Chemistry
Year
1990
Tongue
English
Weight
633 KB
Volume
86
Category
Article
ISSN
0956-5000

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

A semantic tree algorithm for the genera
A semantic tree algorithm for the generation of sextet polynomials of hexagonal systems
✍ M.M. Balakrishnarajan; P. Venuvanalingam πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 541 KB

The sextet polynomial that counts different ways of selecting varying number of resonating sextets on the hexagonal system is computed using a search based symbol manipulation algorithm. This is a #P Complete combinatorial enumeration problem, and artificial intelligence (AI) is employed for efficie

Calculating the number of spanning trees
Calculating the number of spanning trees in a labeled planar molecular graph whose inner dual is a tree
✍ P. E. John; R. B. Mallion πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 496 KB πŸ‘ 3 views

The quantum mechanical relevance of the concept of a spanning tree extant within a given molecular graph-specifically, one that may be considered to represent the carbon-atom connectivity of a particular (planar) conjugated system-was first explicitly pointed out by Professor Roy McWeeny in his now-