𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characteristic and matching polynomials of chemical graphs

✍ Scribed by W.C. Herndon; T.P. Radhakrishnan; T.P. Zivkovic

Book ID
107733306
Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
476 KB
Volume
152
Category
Article
ISSN
0009-2614

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computational algorithms for matching po
Computational algorithms for matching polynomials of graphs from the characteristic polynomials of edge-weighted graphs
✍ Haruo Hosoya; K. Balasubramanian πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 736 KB

Computational algorithms are described which provide for constructing the set of associated edgeweighted directed graphs such that the average of the characteristic polynomials of the edge-weighted graphs gives the matching polynomial of the parent graph. The weights were chosen to be unities or pur

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