Efficient closed domination in digraph products
- 16 Downloads
A digraph D is an efficient closed domination digraph if there exists a subset S of V(D) for which the closed out-neighborhoods centered in vertices of S form a partition of V(D). In this work we deal with efficient closed domination digraphs among several product of digraphs. We completely describe the efficient closed domination digraphs among lexicographic and strong products of digraphs. We characterize those direct products of digraphs that are efficient closed domination digraphs, where factors are either two cycles or two paths. Among Cartesian product of digraphs, we describe all such efficient closed domination digraphs such that they are a Cartesian product digraph either with a cycle or with a star.
KeywordsEfficient closed domination Digraphs Products of digraphs
Mathematics Subject Classification05C69 05C76
- Bange DW, Barkauskas AE, Slater PJ (1978) Disjoint dominating sets in trees. Sandia Laboratories Report, SAND 78-1087JGoogle Scholar
- Kraner Šumenjak T, Peterin I, Rall DF, Tepeh A (2016) Partitioning the vertex set of G to make GDH an efficient open domination graph. Discrete Math Theoret Comput Sci 18:#10Google Scholar
- Wang Y-L, Wu KH, Kloks T (2013) On perfect absorbants in generalized de Bruijn digraphs. In: Proceedings of the frontiers in algorithmics and algorithmic aspects in information and management, third joint international conference, FAW-AAIM, pp 303–314Google Scholar