The higher-order matching polynomial of a graph
Summary: Given a graph \(G\) with \(n\) vertices, let \(p(G,j)\) denote the number of ways \(j\) mutually nonincident edges can be selected in \(G\). The polynomial \(M(x)=\sum_{j=0}^{[n/2]}(-1)^{j}p(G,j)x^{n-2j}\), called the matching polynomial of \(G\), is closely related to the Hosoya index introduced in applications in physics and chemistry. In this work we generalize this polynomial by introducing the number of disjoint paths of length \(t\), denoted by \(p_{t}(G,j)\). We compare this higher-order matching polynomial with the usual one, establishing similarities and differences. Some interesting examples are given. Finally, connections between our generalized matching polynomial and hypergeometric functions are found.
- Product of two hypergeometric functions with power arguments
- Coulson function and Hosoya index: extension of the relationship to polycyclic graphs and to new types of matching polynomials
- Higher order matching polynomial
- scientific article; zbMATH DE number 4191717 (Why is no real title available?)
- scientific article; zbMATH DE number 3989395 (Why is no real title available?)
- scientific article; zbMATH DE number 6148021 (Why is no real title available?)
- On the matching polynomial of hypergraphs
- 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
- The matching polynomials of hypergraphs and weighted hypergraphs
- d-orthogonal analogs of classical orthogonal polynomials
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)
