Graphs with few matching roots
Combinatorics
2012-04-24 v3
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.
Keywords
Cite
@article{arxiv.1011.0284,
title = {Graphs with few matching roots},
author = {Ebrahim Ghorbani},
journal= {arXiv preprint arXiv:1011.0284},
year = {2012}
}
Comments
14 pages, 7 figures, 1 appendix table. Final version. Some typos are fixed