On the largest matching roots of graphs with cut edges

DOI10.1016/j.ipl.2018.02.002zbMath1460.05092OpenAlexW2795158804MaRDI QIDQ1751416

Hailiang Zhang

Publication date: 25 May 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.02.002

zbMATH Keywords

combinatorial problemsmatching polynomialedge cutlargest matching root

Mathematics Subject Classification ID

Graph polynomials (05C31)

Cites Work

• Unnamed Item
• A new expression for matching polynomials
• Bounds on the largest root of the matching polynomial
• Recent results in the theory of graph spectra
• An introduction to matching polynomials
• Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover

This page was built for publication: On the largest matching roots of graphs with cut edges