Laplacian integral graphs in S(a, b)

Abstract: Let be the family of graphs with n vertices and m edges, when n and m are previously given. It is well-known that there is a subset of constituted by graphs G such that the vertex connectivity, the edge connectivity, and the minimum degree are all equal. In this paper, S(a, b)-classes of connected (a, b)-linear graphs with n vertices and m edges are described, where m is given as a function of . Some of them have extremal graphs for which the equalities above are extended to algebraic connectivity. These graphs are Laplacian integral although they are not threshold graphs. However, we do build threshold graphs in S(a, b). [Copyright &y& Elsevier]