![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
Abstract
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.