Abstract
Dominating sets are widely applied in the design and efficient use of computer networks. They can be used to decide the placement of limited resources, so that every node has access to the resource through neighbouring node. The most efficient solution is one that avoids duplication of access to the resources. This more restricted version of minimum dominating set is called an private dominating set. A vertex v in a digraph D is called a private out-neighbor of the vertex u in S (subset of V(D)) if u is the only element in the intersection of in-neighborhood set of v and S. A subset S of the vertex set V (D) of a digraph D is called a private out-dominating set of D if every vertex of V − S is a private out-neighbor of some vertex of S. The minimum cardinality of a private out-dominating set is called the private out-domination number. In this paper, we investigate the private out-domination number of generalized de Bruijn digraphs. We estabilsh the bounds of private out-domination number. Finally, we present exact values and sharp upperbounds of private out-domination number of some classes of generalized de Bruijn digraphs.
Recommended Citation
Marimuthu, G. and Johnson, B.
(2014).
Private Out-Domination Number of Generalized de Bruijn Digraphs,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 9,
Iss.
2, Article 4.
Available at:
https://digitalcommons.pvamu.edu/aam/vol9/iss2/4