Bounds on the largest root of the matching polynomial

DOI10.1016/0012-365X(92)90718-UzbMath0799.05052OpenAlexW2090265923MaRDI QIDQ1208371

David C. Fisher, Jennifer K. Ryan

Publication date: 16 May 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90718-u

zbMATH Keywords

eigenvaluematchingboundsindependent setline graphmatching polynomial

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items (9)

On a conjecture of Wilf ⋮ On the largest matching roots of graphs with a given number of pendent vertices ⋮ Note on the Smallest Root of the Independence Polynomial ⋮ Further results on the largest matching root of unicyclic graphs ⋮ On the largest matching roots of graphs with cut edges ⋮ Lower bounds on matching energy of graphs ⋮ Extremal matching energy and the largest matching root of complete multipartite graphs ⋮ Generalizations of the matching polynomial to the multivariate independence polynomial ⋮ On a Poset of Trees II

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• Hermite polynomials and a duality relation for matchings polynomials
• Theory of monomer-dimer systems
• Dependence polynomials
• Lower bounds on the number of triangles in a graph
• On the theory of the matching polynomial
• The Number of Words of Length n in a Graph Monoid

This page was built for publication: Bounds on the largest root of the matching polynomial