1 paper · 1 filter
Keivan Hassani Monfared, Sudipta Mallik
A spectral characterization of the matching number (the size of a maximum matching) of a graph is given. More precisely, it is shown that the graphs G of order n whose matching num…