Beezer, R.A. and Farrell, E.J. (1995) The Matching Polynomial of a Regular Graph. Discrete Mathematics, 137, 7-18.
https://doi.org/10.1016/0012-365x(93)e0125-n

has been cited by the following article:

• TITLE: On Matching Characterization of P m ∪T( 1,3,n )

  AUTHORS: Shichang Shen

  KEYWORDS: T-Shape Tree, Matching Polynomial, Matching Characterization

  JOURNAL NAME: Open Journal of Applied Sciences, Vol.15 No.4, April 17, 2025

  ABSTRACT: We consider the problem of graphs characterization by its matching polynomial. In the paper, we show that P m ∪T( 1,3,n ) are determined by its matching polynomial iff m is even or 3 and n≠3,6,11 .