scientific article; zbMATH DE number 7028012

DOI10.13471/J.CNKI.ACTA.SNUS.2018.04.009zbMATH Open1424.05156MaRDI QIDQ4623656FDOQ4623656

Authors: Baoxiang Tang, Han Ren 

Publication date: 22 February 2019

Title of this publication is not available (Why is that?)

Recommendations

• Four types of nested recursive methods for finding graph perfect matching numbers
• The nested recursive method of analytic formula of the number of perfect matchings for two types of graphs
• A recursive method for finding the number of perfect matchings of two types of graphs
• Counting formulas for the number of perfect matchings of three types of graphs
• Recursive method for perfect matching number in two types of graphs
• The perfect matching number of three types of graphs based on the recursive method of matching a certain vertex classification
• Recurrence calculation of the perfect matchings number of two types of graphs
• The counting formula of the perfect matchings of three types of special graphs
• scientific article; zbMATH DE number 6453473
• Recursive method for perfect matching numbers by matching vertex classification

zbMATH Keywords

characteristic equationgeneral solutionperfect matchinglinear recurrence relation

Mathematics Subject Classification ID

Applications of graph theory (05C90) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

This page was built for publication:

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