Rubalcaba, Robert R.; Slater, Peter J. Efficient \((j,k)\)-domination. (English) Zbl 1142.05062 Discuss. Math., Graph Theory 27, No. 3, 409-423 (2007). Summary: A dominating set \(S\) of a graph \(G\) is called efficient if \(|N[v]\cap S|=1\) for every vertex \(v\in V(G\). That is, a dominating set \(S\) is efficient if and only if every vertex is dominated exactly once. In this paper, we investigate efficient multiple domination. There are several types of multiple domination defined in the literature: \(k\)-tuple domination, \(\{k\}\)-domination, and \(k\)-domination. We investigate efficient versions of the first two as well as a new type of multiple domination. Cited in 5 Documents MSC: 05C69 Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) Keywords:efficient domination; multiple domination PDFBibTeX XMLCite \textit{R. R. Rubalcaba} and \textit{P. J. Slater}, Discuss. Math., Graph Theory 27, No. 3, 409--423 (2007; Zbl 1142.05062) Full Text: DOI Link