On the theory of the matching polynomial
- 1 June 1981
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 5 (2) , 137-144
- https://doi.org/10.1002/jgt.3190050203
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 consider the relation between the matching and characteristic polynomials of a graph. Finally, we consider results which provide information on the zeros of α(G).Keywords
This publication has 9 references indexed in Scilit:
- An introduction to matching polynomialsJournal of Combinatorial Theory, Series B, 1979
- On the calculation of the acyclic polynomialTheoretical Chemistry Accounts, 1978
- Graph theory and molecular orbitals. 19. Nonparametric resonance energies of arbitrary conjugated systemsJournal of the American Chemical Society, 1977
- A new definition of Dewar-type resonance energiesJournal of the American Chemical Society, 1976
- Theory of monomer-dimer systemsCommunications in Mathematical Physics, 1972
- Topological Index. A Newly Proposed Quantity Characterizing the Topological Nature of Structural Isomers of Saturated HydrocarbonsBulletin of the Chemical Society of Japan, 1971
- General properties of polymer systemsCommunications in Mathematical Physics, 1971
- Location of the zeros of the partition function for some classical lattice systemsPhysics Letters A, 1970
- Monomers and DimersPhysical Review Letters, 1970