Recurrence calculation of the perfect matchings number of two types of graphs
From MaRDI portal
Publication:5209760
DOI10.16163/J.CNKI.22-1123/N.2019.02.003zbMATH Open1449.05212MaRDI QIDQ5209760FDOQ5209760
Authors: Baoxiang Tang, Han Ren 
Publication date: 22 January 2020
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)
- A recursive method for finding the number of perfect matchings of two types of graphs
- Counting near-perfect matchings on \(C_m \times C_n\) tori of odd order in the Maple system
- Enumerating perfect matchings in inductively-defined families of graphs
- An infinite family of graphs with a facile count of perfect matchings
- Perfect matchings in edge-transitive graphs
- Title not available (Why is that?)
- Four types of nested recursive methods for finding graph perfect matching numbers
- 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
- Perfect matching in graphs: an approach via Gröbner basis
- Exact and asymptotic enumeration of perfect matchings in self-similar graphs
- Counting formulas of perfect matchings of two types of graphs
- The number of perfect matchings in two types of 3-regular graphs
- Using recurrence relation to count a number of perfect matching in linear chain and snake chain graphs
- The nested recursive method of analytic formula of the number of perfect matchings for two types of 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
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)
