Liu, W., Guo, Q., Zhang, Y., Feng, L. and Gutman, I. (2017) Further Results on the Largest Matching Root of Unicyclic Graphs. Discrete Applied Mathematics, 221, 82-88.

has been cited by the following article:

• TITLE: Constructing Matching Equivalent Graphs

  AUTHORS: Tingzeng Wu, Huazhong Lü

  KEYWORDS: Matching Polynomial, Matching Equivalent, Cospectral

  JOURNAL NAME: Applied Mathematics, Vol.8 No.4, April 24, 2017

  ABSTRACT: Two nonisomorphic graphs G and H are said to be matching equivalent if and only if G and H have the same matching polynomials. In this paper, some families matching equivalent graphs are constructed. In particular, a new method to construct cospectral forests is given.