Graphs with few matching roots
classification
🧮 math.CO
keywords
graphsmatchingconsequencedeterminedetermineddistinctfamiliesfind
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.