On graphs whose third Laplacian matching root is small

DOI10.1007/S11587-025-01040-1MaRDI QIDQ6847013zbMATH OpenFDO

Authors Mengge Li, Maurizio Brunetti, Jianfeng Wang

Publication date 10 March 2026

Published in Ricerche di Matematica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11587-025-01040-1

zbMATH Keywords

Laplacian matching polynomialminimal forbidden subgraphspolynomial roots

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03)

Cites work

• A relation between the matching number and Laplacian spectrum of a graph
• Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs
• Graphs characterized by Laplacian eigenvalues
• Graphs with fourth Laplacian eigenvalue less than two
• scientific article; zbMATH DE number 4208111 (Why is no real title available?)
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• Laplacian matching polynomial of graphs
• Laplacian matrices of graphs: A survey
• On graphs with at most three Laplacian eigenvalues greater than or equal to two.
• On graphs with small number of Laplacian eigenvalues greater than two
• On the location of zeros of the Laplacian matching polynomials of graphs
• The average Laplacian polynomial of a graph
• Theory of monomer-dimer systems

This page was built for publication: On graphs whose third Laplacian matching root is small

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