![]() |
CiteULike | ![]() |
dsquared's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
On the theory of the matching polynomialby: C. D. Godsil, I. Gutman
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractIn this paper we report on the properties of the matching polynomial alpha(G) of a graph G. We present a number of recursion formulas for alpha(G), from which it follows that many families of orthogonal polynomials arise as matching polynomials of suitable families of graphs. We consider the relation between the matching and characteristic polynomials of a graph. Finally, we consider results which provide information on the zeros of alpha(G).
BibTeX record
RIS record