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
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.
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,
## 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