๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Factorization and recursion relations of the matching and characteristic polynomials of periodic polymer networks

โœ Scribed by Haruo Hosoya

Book ID
105115297
Publisher
Springer
Year
1991
Tongue
English
Weight
805 KB
Volume
7
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Characteristic polynomials of organic po
Characteristic polynomials of organic polymers and periodic structures
โœ K. Balasubramanian ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 540 KB

It is shown that the Frame's method (also, Le Verrier-Faddeev's method) for characteristic polynomials of chemical graphs can be extended to periodic graphs and structures. The finite periodic structures are represented by cyclic structures in the Born-von K h n a n boundary condition which leads to

Operator technique for obtaining the rec
Operator technique for obtaining the recursion formulas of characteristic and matching polynomials as applied to polyhex graphs
โœ Haruo Hosoya; Noriko Ohkami ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 581 KB

A simple and efficient method, called an operator technique, for obtaining the recurrence relation of a given counting polynomial, e.g., characteristic Pc; (x) or matching M c (x) polynomial, for periodic networks is proposed. By using this technique the recurrence relations of the Pc (x) and M(; (x

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