𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Spectra of chemical trees

✍ Scribed by K. Balasubramanian


Book ID
104580598
Publisher
John Wiley and Sons
Year
1982
Tongue
English
Weight
441 KB
Volume
21
Category
Article
ISSN
0020-7608

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

A method is developed for obtaining the spectra of trees of NMR and chemical interests. The characteristic polynomials of branched trees can be obtained in terms of the characteristic polynomials of unbranched trees and branches by pruning the tree at the joints. The unbranched trees can also be broken down further till we obtain a tree containing just two vertices. This effectively reduces the order of the secular determinant of the tree we started with to determinants of orders atmost equal to the number of vertices in the branch containing the largest number of vertices. An illustrative example of a NMR graph is given for which the 22 Γ— 22 secular determinant is reduced to determinants of orders atmost 4 Γ— 4 in just the second step of the algorithm. The tree pruning algorithm can be applied even to trees with no symmetry elements and such a factoring can be achieved. Methods developed here can be elegantly used to find if two trees are cospectral and to construct cospectral trees.


πŸ“œ SIMILAR VOLUMES


Chemical trees enumeration algorithms
✍ Roberto Aringhieri; Pierre Hansen; Federico Malucelli πŸ“‚ Article πŸ“… 2003 πŸ› Springer 🌐 English βš– 140 KB
The Estrada index of chemical trees
✍ Aleksandar IliΔ‡; Dragan StevanoviΔ‡ πŸ“‚ Article πŸ“… 2009 πŸ› Springer 🌐 English βš– 217 KB