The influence of special vertices on strong domination
A set \(D\) of vertices of a graph \(G=(V,E)\) is a strong dominating set if any vertex \(y\in V-D\) has a neighbour \(x\in D\) so that the degree of \(x\) is greater than or equal to the degree of \(y\). A bound on the strong domination number, the minimum cardinality of a strong dominating set, is given.
scientific article; zbMATH DE number 1322047