Bounds of signless Laplacian spectrum of graphs based on the k-domination number

Let G=(V(G),E(G)) be a graph. A k-dominating set in G is a subset X of V(G) such that each element of V(G)∖X is adjacent to at least k vertices of X. The least cardinality of a k-dominating set is the k-domination number. In this paper, we will give some bounds of the signless Laplacian spectrum of G involving the k-domination number.