Graphs with few matching roots

Abstract

We determine all graphs whose matching polynomials have at most five distinct zeros. As a consequence, we find new families of graphs which are determined by their matching polynomial.

14 pages, 7 figures, 1 appendix table. Final version. Some typos are fixed

Cited by in corpus (1)

• Graphs which their certain polynomials have few distinct roots- a survey