The largest matching roots of unicyclic graphs with a fixed matching number

摘要

In this note, we study the largest matching roots of unicyclic graphs with a given number of fixed matching number. We also characterize the extremal graph with respect to the largest matching roots. In addition, we also study this problem on the trees with a given number of fixed matching number.