On the minimum spectral radius of unicyclic graphs with a given matching number

Joyentanuj Das, Debabrota Mondal

A matching $M$ in a graph $G=(V,E)$ is a set of edges such that no two edges in $M$ share a common vertex. A matching with maximum cardinality is called a maximum matching and i…