Perfect matching counts for 2-2nP₅ and 2-nK₁,1,1,3 graphs
From MaRDI portal
Publication:3385916
DOI10.13413/J.CNKI.JDXBLXB.2019450zbMATH Open1463.05445MaRDI QIDQ3385916FDOQ3385916
Authors: Baoxiang Tang, Han Ren 
Publication date: 14 January 2021
Recommendations
- Recurrence calculation of the perfect matchings number of two types of graphs
- Counting formulas of perfect matchings of two types of graphs
- Perfect matching number of two kinds of graphs based on recursive method of matching vertex classification
- 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
This page was built for publication: Perfect matching counts for \(2\)-\(2n{P_5}\) and \(2\)-\(n{K_{1,1,1,3}}\) graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3385916)
