On the largest matching roots of graphs with a given number of pendent vertices

DOI10.1016/J.DAM.2018.07.028zbMath1405.05110OpenAlexW2890065874WikidataQ129207751 ScholiaQ129207751MaRDI QIDQ1727760

Guanglong Yu, Guangting Chen, Hailiang Zhang

Publication date: 20 February 2019

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

Full work available at URL: https://doi.org/10.1016/j.dam.2018.07.028

zbMATH Keywords

matching polynomialextremal graphpendent vertexlargest matching root

Mathematics Subject Classification ID

Graph polynomials (05C31) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Further results on the largest matching root of unicyclic graphs
• Bounds on the largest root of the matching polynomial
• Recent results in the theory of graph spectra
• The largest matching root of unicyclic graphs
• Theory of monomer-dimer systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the largest matching roots of graphs with a given number of pendent vertices