Recurrence calculation of the perfect matchings number of two types of graphs

DOI10.16163/J.CNKI.22-1123/N.2019.02.003MaRDI QIDQ5209760zbMATH OpenFDO

Authors Baoxiang Tang, Han Ren

Publication date 22 January 2020

zbMATH Keywords

characteristic equationperfect matchinglinear recurrence relation

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A recursive method for finding the number of perfect matchings of two types of graphs
• The enumeration of perfect matchings in two types of graphs
• The nested recursive method of analytic formula of the number of perfect matchings for two types of graphs
• scientific article; zbMATH DE number 6178330
• The number of perfect matchings of two types of particular graphs

Cited in

(17)

• Perfect matching in graphs: an approach via Gröbner basis
• An infinite family of graphs with a facile count of perfect matchings
• The number of perfect matchings in two types of 3-regular graphs
• Perfect matching number of two kinds of graphs based on recursive method of matching vertex classification
• Bipartite graphs associated with Pell, Mersenne and Perrin numbers
• Using recurrence relation to count a number of perfect matching in linear chain and snake chain graphs
• Enumerating perfect matchings in inductively-defined families of graphs
• Perfect matchings in edge-transitive graphs
• The nested recursive method of analytic formula of the number of perfect matchings for two types of graphs
• Counting formulas of perfect matchings of two types of graphs
• A recursive method for finding the number of perfect matchings of two types of graphs
• Exact and asymptotic enumeration of perfect matchings in self-similar graphs
• scientific article; zbMATH DE number 7028012 (Why is no real title available?)
• Four types of nested recursive methods for finding graph perfect matching numbers
• Counting near-perfect matchings on \(C_m \times C_n\) tori of odd order in the Maple system
• Enumeration of perfect matchings of a type of 3-regular graphs
• Perfect matching counts for \(2\)-\(2n{P_5}\) and \(2\)-\(n{K_{1,1,1,3}}\) graphs

This page was built for publication: Recurrence calculation of the perfect matchings number of two types of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5209760)