On the location of zeros of the Laplacian matching polynomials of graphs
- 11 April 2022
- journal article
- research article
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 56 (3) , 755-771
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (12171002, 11871073)
- Natural Science Foundation of Anhui Province (2008085MA03)
This publication has 14 references indexed in Scilit:
- Interlacing families I: Bipartite Ramanujan graphs of all degreesAnnals of Mathematics, 2015
- On the location of roots of graph polynomialsEuropean Journal of Combinatorics, 2014
- Spectra of Graphs2012
- An analogue of the Gallai–Edmonds Structure Theorem for non-zero roots of the matching polynomialJournal of Combinatorial Theory, Series B, 2010
- On the matching polynomial of subdivision graphsDiscrete Applied Mathematics, 2009
- An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any treeLinear Algebra and its Applications, 2007
- Bounding the largest eigenvalue of trees in terms of the largest vertex degreeLinear Algebra and its Applications, 2003
- Matchings and walks in graphsJournal of Graph Theory, 1981
- On the theory of the matching polynomialJournal of Graph Theory, 1981
- Theory of monomer-dimer systemsCommunications in Mathematical Physics, 1972