GRAPHS CHARACTERIZED BY THE ROOTS OF MATCHING
Ma Hai · Journal of Qufu Normal University · 2001
In this paper, the authors completely characterize the graphs with M 1(G)≤2, and the graphs with M 2(G)1 , where M 1(G) and M 2(G) are the first root and the second root of the matching polynomial μ(G,x) of the graph G respectively`.