23 citations · 30 across the 5 of their papers we have counts for
1 paper · 1 filter
Dan Drake
We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating fu…