摘要
The graphs considered here are finite and contain no loops nor multiple edges. Let G be such a graph, M(G; W) be its matching polynomial defined by Farrell in 1979, P(G; λ) be its chromatic polynomial. A graph G is matching unique if for any graph H,
