𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Comments on characteristic polynomials of chemical graphs

✍ Scribed by J. Brocas

Publisher
Springer
Year
1985
Tongue
English
Weight
177 KB
Volume
68
Category
Article
ISSN
1432-2234

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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

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