  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].
