The higher-order matching polynomial of a graph

DOI10.1155/IJMMS.2005.1565MaRDI QIDQ2575962zbMATH OpenFDO

Authors Oswaldo Araujo, Mario E. Estrada, Daniel A. Morales, Juan Rada

Publication date 7 December 2005

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/51823

Mathematics Subject Classification ID

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

Recommendations

• Higher order matching polynomial
• Matchings and walks in graphs
• On ``The matching polynomial of a polygraph
• Matching polynomials and duality
• On the matching polynomial of hypergraphs

Cited in

(11)

• Coulson function and Hosoya index: extension of the relationship to polycyclic graphs and to new types of matching polynomials
• scientific article; zbMATH DE number 4191717 (Why is no real title available?)
• Higher order matching polynomial
• A novel graph-operational matrix method for solving multidelay fractional differential equations with variable coefficients and a numerical comparative survey of fractional derivative types
• scientific article; zbMATH DE number 6148021 (Why is no real title available?)
• On the matching polynomial of hypergraphs
• scientific article; zbMATH DE number 3989395 (Why is no real title available?)
• \(d\)-orthogonal analogs of classical orthogonal polynomials
• Higher-order matching polynomials and \(d\)-orthogonality
• Product of two hypergeometric functions with power arguments
• The matching polynomials of hypergraphs and weighted hypergraphs

This page was built for publication: The higher-order matching polynomial of a graph

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