Perfect matching counts for 2-2nP₅ and 2-nK₁,1,1,3 graphs

DOI10.13413/J.CNKI.JDXBLXB.2019450MaRDI QIDQ3385916zbMATHFDO

Authors Baoxiang Tang, Han Ren

Publication date 14 January 2021

zbMATH Keywords

classificationperfect matchingrecurrence relationcounting formula

Mathematics Subject Classification ID

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

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

Cited in

(3)

• An infinite family of graphs with a facile count of perfect matchings
• Using recurrence relation to count a number of perfect matching in linear chain and snake chain graphs
• Perfect matchings in edge-transitive 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)