Can someone kindly give me an expository reference on matching polynomial and its roots? (there is a proof that they are always real?)
I saw these two related discussions,
Can someone kindly give me an expository reference on matching polynomial and its roots? (there is a proof that they are always real?)
I saw these two related discussions,
I really like that paper:
C. D. Godsil and I. Gutman. On the matching polynomial of a graph. In L. Lovasz and V. T. Sos, editors, Algebraic Methods in graph theory, volume I of Colloquia Mathematica Societatis Janos Bolyai, 25, pages 241–249. Janos Bolyai Mathematical Society, 1981.
The best referrence is the following thesis
By; Mirko Visontai
Certicates for properties of stability polynomials of graphs
Graphs With Few Matching Roots Ebrahim Ghorbani