The matching polynomials of hypergraphs and weighted hypergraphs

DOI10.1142/s1793830922501646zbMath1525.05144MaRDI QIDQ6059085

Jiawen Yang, Wen-Huan Wang

Publication date: 2 November 2023

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

hypergraphmatching polynomialrootperfect matching numberweighted matching polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• A new expression for matching polynomials
• Recent results in the theory of graph spectra
• An introduction to matching polynomials
• On the adjacency spectra of hypertrees
• The matching polynomials and spectral radii of uniform supertrees
• Scaling matrices and counting the perfect matchings in graphs
• The spectra of uniform hypertrees
• Theory of monomer-dimer systems
• Enumeration of perfect matchings of a type of Cartesian products of graphs
• Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture
• On the theory of the matching polynomial
• Polynomial reconstruction of the matching polynomial
• The minimum spectral radius of the r-uniform supertree having two vertices of maximum degree

This page was built for publication: The matching polynomials of hypergraphs and weighted hypergraphs