Matching polynomials: A matrix approach and its applications
From MaRDI portal
Publication:1086253
A new approach is formulated for the matching polynomial m(G) of a graph G. A matrix A(G) is associated with G. A certain function defined on A(G) yields the matching polynomial of G. This approach leads to a simple characterization of m(G). It also facilitates a technique for constructing graphs with a given matching polynomial.
Recommendations
Cites work
Cited in
(15)- On the theory of matching equivalent graphs and rook equivalent chessboards
- Laplacian matching polynomial of graphs
- Higher order matching polynomial
- The Medusa algorithm for polynomial matings
- Matchings in tetrameric 1, 3-adamantane
- scientific article; zbMATH DE number 3851147 (Why is no real title available?)
- scientific article; zbMATH DE number 3972899 (Why is no real title available?)
- scientific article; zbMATH DE number 3972900 (Why is no real title available?)
- scientific article; zbMATH DE number 3972902 (Why is no real title available?)
- A new expression for matching polynomials
- scientific article; zbMATH DE number 1195749 (Why is no real title available?)
- scientific article; zbMATH DE number 1869703 (Why is no real title available?)
- scientific article; zbMATH DE number 861360 (Why is no real title available?)
- Counting matchings in graphs
- On the matching arrangement of a graph and properties of its characteristic polynomial
This page was built for publication: Matching polynomials: A matrix approach and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086253)