A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
The higher-order matching polynomial of a graph
International Journal of Mathematics and Mathematical Sciences
Given a graphGwithnvertices, letp(G,j)denote the number of waysjmutually nonincident edges can be selected inG. The polynomialM(x)=∑j=0[n/2](−1)jp(G,j)xn−2j, called the matching polynomial ofG, is closely related to the Hosoya index introduced in applications in physics and chemistry. In this work we generalize this polynomial by introducing the number of disjoint paths of lengtht, denoted bypt(G,j). We compare this higher-order matching polynomial with the usual one, establishing similaritiesdoi:10.1155/ijmms.2005.1565 fatcat:ybpnjbn7vzg2xcwgdxlu64pu74