Recursive solving of di-forcing polynomials for ladder graphs
The ladder graph Ln is the Cartesian product of the paths Pn and P2.The di-forcing polynomial of Ln is a binary enumera-tive polynomial of forcing and anti-forcing numbers of all perfect matchings of the graph.We derive a recurrence formula of the di-forcing polynomial for ladder graphsby classification discussion and enumerating of the matching edge associated with a given vertex.And based on this,wecompute the generating function of the di-forcing polynomials for all ladder graphs anddi-forced polynomials for some ladder graphs with low order.
ladder graphperfect matchingdi-forcing polynomialforcing polynomialanti-forcing polynomialrecursion rela-tionshipgenerating function
万方数据
维普
