$(k,k^{\prime },k^{\prime \prime })$-domination in graphs

Abstract

We first introduce the concept of (k,k',k'')-domination numbers in graphs, which is a generalization of many domination parameters. Then we find lower and upper bounds for this parameter, which improve many well-known results in literatures.