Matching polynomials of path-trees of a complete bipartite graph

DOI10.1016/J.DAM.2025.04.014MaRDI QIDQ6969951zbMATH OpenFDO

Authors Haiyan Chen, Yinxia Yuan

Publication date 19 June 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.04.014

zbMATH Keywords

complete bipartite graphmatching polynomialpath-tree

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites work

• A complete solution to a conjecture on the \({\beta}\)-polynomials of graphs
• An introduction to matching polynomials
• Graph energy
• scientific article; zbMATH DE number 3679880 (Why is no real title available?)
• scientific article; zbMATH DE number 3623599 (Why is no real title available?)
• Matchings and walks in graphs
• On the theory of the matching polynomial
• Problems in algebraic combinatorics
• Spectra of graphs. Theory and application
• The matching energy of a graph
• The matching polynomial of the path-tree of a complete graph

This page was built for publication: Matching polynomials of path-trees of a complete bipartite graph

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