1. Eigenvalues of the Laplacian of a graph∗
2. Spectral ordering of trees with small index
3. Asymptotic results on the spectral radius and the diameter of graphs
4. S. Elaydi, An Introduction to Difference Equations, 3rd ed., Undergraduate Texts in Mathematics, Springer, New York, 2005.
5. M. Fürer, C. Hoppen, and V. Trevisan, Efficient diagonalization of symmetric matrices associated with graphs of small treewidth. 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Dagstuhl, Germany, 2020, A. Czumaj, A. Dawar, and E. Merelli, eds., vol. 168 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum für Informatik, pp. 52:1–52:18.