𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Matching polynomial and topological resonance energy of C70

✍ Scribed by D. Babić; O. Ori

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
315 KB
Volume
234
Category
Article
ISSN
0009-2614

No coin nor oath required. For personal study only.

✦ Synopsis

Matching polynomial and its zeros for the molecular graph of C70 are reported. Topological resonance energy (TRE) is calculated and compared with that reported for C60, and with the values obtained by conjugated circuits model. TRE values indicate slightly greater stability of C70, in agreement with recent experimental results.

📜 SIMILAR VOLUMES

On computation of the topological resona
On computation of the topological resonance energy
✍ B. Mohar; N. Trinajstić 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 536 KB

## Abstract The topological resonance energy (TRE) model was introduced independently by the Zagreb Group (in 1975) and by Aihara (in 1976). Several practical obstacles arise in the computation of TRE. Ways to surmount them are pointed out. Descriptions of algorithms, optimizations, and the efficie

Topological resonance energy predictions
Topological resonance energy predictions of the stability of fullerene clusters
✍ M. Manoharan; M.M. Balakrishnarajan; P. Venuvanalingam; K. Balasubramanian 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 490 KB

The topological resonance energies (TRE) for various fullerene clusters ( C2a to C,) have been computed and based on this, stabilities of fttllerenes are discussed. Trend in stability predicted by the TRE model is compared with predictions from the conjugated circuit model as well as the MNDO and ab

On the theory of the matching polynomial
On the theory of the matching polynomial
✍ C. D. Godsil; I. Gutman 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 325 KB 👁 1 views

## Abstract In this paper we report on the properties of the matching polynomial α(__G__) of a graph __G__. We present a number of recursion formulas for α(__G__), from which it follows that many families of orthogonal polynomials arise as matching polynomials of suitable families of graphs. We con