Graphs with few matching roots

From MaRDI portal
Publication:367053

DOI10.1007/S00373-012-1186-7zbMATH Open1272.05081arXiv1011.0284OpenAlexW2130641009MaRDI QIDQ367053FDOQ367053

E. Ghorbani

Publication date: 26 September 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1011.0284





Cites Work


Cited In (10)






This page was built for publication: Graphs with few matching roots

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