Matching integral 2-connected graphs
Combinatorics
2021-09-14 v2
Abstract
In this note we present an infinite family of 2-connected graphs such that their matching polynomials have only integer zeros. This answers in negative a question of Akbari et al. [Graphs with integer matching polynomial zeros, Discrete Appl. Math. 224 (2017), 1-8].
Cite
@article{arxiv.2109.04118,
title = {Matching integral 2-connected graphs},
author = {Ebrahim Ghorbani},
journal= {arXiv preprint arXiv:2109.04118},
year = {2021}
}
Comments
Some typos corrected