The higher-order matching polynomial of a graph

DOI10.1155/IJMMS.2005.1565zbMath1076.05062MaRDI QIDQ2575962

Juan Rada, Oswaldo Araujo, Mario 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

Mathematics Subject Classification ID

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

Related Items (4)

Higher-order matching polynomials and \(d\)-orthogonality ⋮ A novel graph-operational matrix method for solving multidelay fractional differential equations with variable coefficients and a numerical comparative survey of fractional derivative types ⋮ \(d\)-orthogonal analogs of classical orthogonal polynomials ⋮ Product of two hypergeometric functions with power arguments

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