𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the computation of characteristic polynomial of a chemical graph

✍ Scribed by P. Křivka; Ž. Jeričević; N. Trinajstić

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
637 KB
Volume
28
Category
Article
ISSN
0020-7608

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the evaluation of the characteristic
On the evaluation of the characteristic polynomial of a chemical graph
✍ Tomislav P. Živković 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 583 KB

## Abstract The evaluation of the characteristic polynomial of a chemical graph is considered. It is shown that the operation count of the Le Verrier–Faddeev–Frame method, which is presently considered to be the most efficient method for the calculation of the characteristic polynomial, is of the o

Computer generation of the characteristi
Computer generation of the characteristic polynomials of chemical graphs
✍ K. Balasubramanian 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 497 KB

A computer program based on the Frame method for the characteristic polynomials of graphs is developed. This program makes use of an efficient polynomial algorithm of Frame for generating the coefficients in the characteristic polynomials of graphs. This program requires as input only the set of ver

Comments on the characteristic polynomia
Comments on the characteristic polynomial of a graph
✍ K. Balasubramanian 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 655 KB

Several unique advantages of the Le Verrier-Fadeev-Frame method for the characteristic polynomials of graphs over the method proposed by Zivkovic recently based on the Givens-Householder method are described. It is shown that the Givens-Householder method proposed by Zivkovic, by itself fails for di

Parallel algorithm for the computation o
Parallel algorithm for the computation of characteristic polynomials of chemical graphs
✍ P. Venuvanalingam; P. Thangavel 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB

A parallel algorithm is developed for the f i t time based on Frame's method to compute the characteristic polynomials of chemical graphs. This algorithm can handle all types of graphs: ordinary, weighted, directed, and signed. Our algorithm takes only linear time in the CRCW PRAM model with O(n9) p