The matching polynomial of a polygraph
✍ Scribed by Darko Babić; Ante Graovac; Bojan Mohar; Tomaž Pisanski
- Book ID
- 104182959
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 564 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The matching polynomial of a graph has coefficients that give the number ofmatchings in the graph. For a regular graph, we show it is possible to recover the order, degree, girth and number of minimal cycles from the matching polynomial. If a graph is characterized by its matching polynomial, then i
## Abstract In this paper we report on the properties of the matching polynomial α(__G__) of a graph __G__. We present a number of recursion formulas for α(__G__), from which it follows that many families of orthogonal polynomials arise as matching polynomials of suitable families of graphs. We con