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

Matching polynomials of fullerene clusters

โœ Scribed by K. Balasubramanian


Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
646 KB
Volume
201
Category
Article
ISSN
0009-2614

No coin nor oath required. For personal study only.

โœฆ Synopsis


Matching polynomials of fullerene cages for &,-CsO are computed and analyzed. Based on these results the tirst few coeffkients of the matching polynomials of C60-Cw cages are obtained. The matching polynomials thus computed are useful in the characterization of aromaticities, computation of the grand canonical partition functions, resonance energies, thermodynamic properties, topological indices and properties of these cages.


๐Ÿ“œ SIMILAR VOLUMES


Spectra of matching polynomials
โœ K. Balasubramanian ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 470 KB
Comment on โ€œCharacteristic polynomials o
โœ P.W. Fowler ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 166 KB

Pairing of the eigenvalues of the signed adjacency matrix is a property of all graphs, not only those of fullerenes. Eigenvalues of this matrix are dependent upon the labelling of the graph and so are not structural invariants.

Regions of polynomial root clustering
โœ T.A. Bickart; E.I. Jury ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 672 KB

A criterion for root exclusion from a region composed as a union of elemental regions-discs and halfplanes-is established. Associated with each elemental region is a derived polynomial which must be by the criterion a strictly Hurwitz polynomial. The criterion is the basis for a root exclusion test,

On the theory of the matching polynomial
โœ C. D. Godsil; I. Gutman ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 325 KB ๐Ÿ‘ 1 views

## Abstract In this paper we report on the properties of the matching polynomial ฮฑ(__G__) of a graph __G__. We present a number of recursion formulas for ฮฑ(__G__), from which it follows that many families of orthogonal polynomials arise as matching polynomials of suitable families of graphs. We con