The higher-order matching polynomial of a graph

DOI10.1155/IJMMS.2005.1565zbMATH Open1076.05062MaRDI QIDQ2575962FDOQ2575962

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

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

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

Mathematics Subject Classification ID

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

Cited In (9)

• Title not available (Why is that?)
• Higher-order matching polynomials and \(d\)-orthogonality
• Higher order matching polynomial
• \(d\)-orthogonal analogs of classical orthogonal polynomials
• Title not available (Why is that?)
• A novel graph-operational matrix method for solving multidelay fractional differential equations with variable coefficients and a numerical comparative survey of fractional derivative types
• Coulson function and Hosoya index: extension of the relationship to polycyclic graphs and to new types of matching polynomials
• Title not available (Why is that?)
• Product of two hypergeometric functions with power arguments

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)