Bounds of Laplacian spectrum of graphs based on the domination number Original Research Article

Let G be a connected graph of order n. A dominating set in G is a subset S of V(G) such that each element of V(G) − S is adjacent to a vertex of S. The least cardinality of a dominating set is the domination number. In the paper, we will give bounds of the Laplacian spectrum of G involving the domination number.