No label defined (Q3320429)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3851147
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3851147

      Statements

      0 references
      1982
      0 references
      characteristic polynomial
      0 references
      adjacency matrix
      0 references
      matching polynomial
      0 references
      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).
      0 references

      Identifiers