… [l] obtained a systematic method to compute matching polynomials for polygraphs. Many
of the known … relations for the matching polynomials of w, and yrn by using the Cayley-Hamilton …

… In the later parts of this chapter, we shall see that the matching polynomial and its zeros
are intimately related with the characteristic polynomial and the graph spectrum. Therefore, at …

… The number of perfect matchings, K, in polygraphs has been … for special classes of polygraphs
and this is especially true … the matching polynomial and perfect matchings in polygraphs…

… For polygraphs of type G × Pm we present a method for … and tabulate matching polynomials
of various polygraphs, … for computation of matching polynomials, permanents and …

… The elements of the product matrix are closely related to the matching polynomials of
specific subgraphs of the polygraph under consideration. These polygraphs include the …

… The number of perfect matchings, K, in polygraphs has been … for special classes of polygraphs
and this is especially true … the matching polynomial and perfect matchings in polygraphs…

… determining the matching polynomial of a polygraph has been … The matching polynomial is
a combinatorial object defined … called p-matching of G; especially, the matching which covers …

… Ghosh et al [36] have studied the matching polynomial coefficients and Hosoya indices for …
polygraphs. Araujo et al [37] have investigated the correlation of the matching polynomial and …

… complexity of the order polynomial (2,3) 261-269 Feigenbaum, J., Directed cartesian-product
graphs have unique factorizations that can be computed in polynomial time (Note) …

… polygraphs, we define simple programs as a special class of polygraphs equipped with a
notion of polynomial … We prove that computations in a simple program have a polynomial size …