Author(s)

Tingzeng Wu¹, Huazhong Lü²

¹School of Mathematics and Statistics, Qinghai Nationalities University, Xining, China.
²School of Mathematics Science, University of Electronic Science and Technology of China, Chengdu, China.

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.

Matching Polynomial, Matching Equivalent, Cospectral

Wu, T. and Lü, H. (2017) Constructing Matching Equivalent Graphs. Applied Mathematics, 8, 476-482. doi: 10.4236/am.2017.84038.