Matching and Laplacian eigenvalues

MaRDI QIDQ5198176zbMATH OpenFDO

Authors Shunzhe Zhang, Mei Lu, Huiqing Liu

Publication date 2 October 2019

zbMATH Keywords

factor-criticalLaplacian eigenvaluenear-perfect matchingperfect matching

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Eigenvalues and perfect matchings
• A tight lower bound on the matching number of graphs via Laplacian eigenvalues
• An inequality using perfect matchings and Laplacian spread of a graph
• The multiplicity of Laplacian eigenvalue two in a connected graph with a perfect matching
• Perfect matchings, eigenvalues and expansion

Cited in

(7)

• Eigenvalues and perfect matchings
• A tight lower bound on the matching number of graphs via Laplacian eigenvalues
• Matching number, Hamiltonian graphs and magnetic Laplacian matrices
• The multiplicity of Laplacian eigenvalue two in a connected graph with a perfect matching
• scientific article; zbMATH DE number 1475186 (Why is no real title available?)
• An inequality using perfect matchings and Laplacian spread of a graph
• Perfect matchings, eigenvalues and expansion

This page was built for publication: Matching and Laplacian eigenvalues

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