scientific article; zbMATH DE number 6178330

MaRDI QIDQ4925979zbMATH OpenFDO

Authors Baoxiang Tang, Han Ren

Publication date 20 June 2013

zbMATH Keywords

recurrence relationhexagonal systemcounting perfect matchings

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The number of perfect matchings in four types of particular graphs
• Counting formulas of the number of perfect matchings for four types of graphs
• scientific article; zbMATH DE number 5952364
• The analytic formulas of the number of perfect matchings for four types of graphs
• The number of perfect matchings of two types of particular graphs
• The number of perfect matchings in three types of graphs
• The number of the perfect matchings for three specific types of graphs
• scientific article; zbMATH DE number 5656434
• The number of perfect matchings in five types of graphs
• The enumeration of perfect matchings in two types of graphs

Cited in

(8)

• scientific article; zbMATH DE number 5656434 (Why is no real title available?)
• scientific article; zbMATH DE number 5952364 (Why is no real title available?)
• Four types of nested recursive methods for finding graph perfect matching numbers
• The analytic formulas of the number of perfect matchings for four types of graphs
• Recurrence calculation of the perfect matchings number of two types of graphs
• THE NUMBER OF DISTINCT 4-CYCLES AND 2-MATCHINGS OF SOME ZERO-DIVISOR GRAPHS
• The number of perfect matchings in four types of particular graphs
• Counting formulas of the number of perfect matchings for four types of graphs

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 Q4925979)