scientific article; zbMATH DE number 3851147

From MaRDI portal
Publication:3320429





By the characteristic polynomial of a graph we mean the characteristic polynomial of its adjacency matrix. The matching polynomial of a graph with n vertices is \(\sum^{n}_{k=0}(-1)^ kp(G,k)x^{n-2k}\) where p(G,k) denotes the number of matchings in G having exactly k edges. This short paper lists a number of analogies between properties of the characteristic and matching polynomials and raises the problem of satisfactorily explaining these. One reasonable explanation has since been presented in a paper written by the reviewer [J. Graph Theory 5, 285-297 (1981; Zbl 0466.05053)]. A survey of the theory of the matching polynomial by the reviewer and the author was given J. Graph Theory 5, 137-144 (1981; Zbl 0462.05051).











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3320429)