Key points are not available for this paper at this time.
In this letter, we present a new lower bound for the treewidth of a graph in terms of the second smallest eigenvalue of its Laplacian matrix. Our bound slightly improves the lower bound given by Chandran and Subramanian Inf. Process. Lett., 87 (2003).
Gima et al. (Thu,) studied this question.