Private domination number of a graph
A. Jaya Prasad, T. Tamizh Chelvam, S. Robinson Chellathurai · Journal of Discrete Mathematical Sciences and Cryptography · 2007
A set S⊆V is said to be private dominating set of a graph G if it is a dominating set and for every u in S there exists an external private neighbour v∈V−S. The maximum cardinality of these sets is called the private domination number and is denoted by Γpvt (G). In this paper some results on the private domination number are obtained.