A tight lower bound on the matching number of graphs via Laplacian eigenvalues (Q2066004)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight lower bound on the matching number of graphs via Laplacian eigenvalues |
scientific article |
Statements
A tight lower bound on the matching number of graphs via Laplacian eigenvalues (English)
0 references
13 January 2022
0 references
Haemers inequality
0 references
0 references
