Throughout all graphs are assumed to be simple. Let A(G) and L(G) denote the adjacency and the Laplacian matrix corresponding to a graph G, respectively. The second smallest eigen- value of L(G) is called the algebraic ...