%0 Journal Article
%T Constructing Matching Equivalent Graphs
%A Tingzeng Wu
%A Huazhong L¨¹
%J Applied Mathematics
%P 476-482
%@ 2152-7393
%D 2017
%I Scientific Research Publishing
%R 10.4236/am.2017.84038
%X Two nonisomorphic graphs <em>G</em> and <em>H</em> are said to be matching equivalent if and only if <em>G</em> and <em>H</em> 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.
%K Matching Polynomial
%K Matching Equivalent
%K Cospectral
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=75586