2 citations · 2 across the 7 of their papers we have counts for
1 paper · 2 filters
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…