Characterization of outerplanar graphs whose second largest eigenvalue is at most 1 (Q2696287)

In the paper, the authors completely characterize all outerplanar graphs with the second largest (adjacent) eigenvalue \(\lambda_2\le 1\). The method is based on the interlacing theorem, which always is adequate for characterizing graphs having large eigenvalues bounded by a small constant. The preparing work is to investigate the subgraphs with \(\lambda_2>1\). In this sense, the authors make excellent work. The proofs are correct, and the description of the structures of these graphs is very clear. The topic studied in this paper is critical and classical. In these years, many scholars paid attention to the characterization of graphs with given properties. So I think this paper may inspire the research on bounding \(\lambda_2\).