The Least Eigenvalue of Graphs with Cut Edges

摘要

In this paper we characterize the unique graph whose least eigenvalue attains the minimum among all connected graphs of fixed order and given number of cut edges.