Abstract
LetG be a graph onn vertices. Ak-matching inG is a set ofk independent edges. If 2k=n then ak-matching is called perfect. The number ofk-matchings inG isp(G, k). (We setp(G, 0)=1). The matchings polynomial ofG is
Our main result is that the number of perfect matchings in the complement ofG is equal to
LetK m be the complete graph onm vertices. Then α(K m ,x) is the Hermite polynomial He n (x) of degreen. Using (1) we show, amongst other results, that
Similar content being viewed by others
References
R. Azor, J. Gillis andJ. D. Victor, Combinatorial applications of Hermite polynomials, manuscript.
A. Erdélyi, W. Magnus, F. Oberhettinger andF. G. Tricomi,Higher Transcendental Functions (Bateman manuscript project), McGraw-Hill, 1953.
C. D. Godsil andI. Gutman, On the theory of the matching polynomial,J. Graph Theory,5 (1981), 137–144.
O. J. Heilmann andE. H. Lieb, Theory of monomer-dimer systems,Comm. Math. Physics,25 (1972), 190–232.
S. A. Joni andG-C. Rota, A vector space analog of permutations with restricted position,J. Combinatorial Theory, Series A,29 (1980), 59–73.
L. Lovász,Combinatorial Problems and Exercises, North-Holland, Amsterdam, 1979.
J. Riordan,An introduction to Combinatorial Analysis, Wiley, 1958.
T. Zaslavsky, Complementary matching vectors and the uniform matching extension property,Europ. J. Comb. 2 (1981), 91–103.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Godsil, C.D. Hermite polynomials and a duality relation for matchings polynomials. Combinatorica 1, 257–262 (1981). https://doi.org/10.1007/BF02579331
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02579331