Efficient Open Domination in Digraph Products
-
Published:2020-04-02
Issue:4
Volume:8
Page:496
-
ISSN:2227-7390
-
Container-title:Mathematics
-
language:en
-
Short-container-title:Mathematics
Author:
Božović Dragana,Peterin Iztok
Abstract
A digraph D is an efficient open domination digraph if there exists a subset S of V ( D ) for which the open out-neighborhoods centered in the vertices of S form a partition of V ( D ) . In this work we deal with the efficient open domination digraphs among four standard products of digraphs. We present a method for constructing the efficient open domination Cartesian product of digraphs with one fixed factor. In particular, we characterize those for which the first factor has an underlying graph that is a path, a cycle or a star. We also characterize the efficient open domination strong product of digraphs that have factors whose underlying graphs are uni-cyclic graphs. The full characterizations of the efficient open domination direct and lexicographic product of digraphs are also given.
Funder
Javna Agencija za Raziskovalno Dejavnost RS
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference30 articles.
1. Handbook of Product Graphs, Second Edition;Hammack,2011
2. Perfect domination in graphs;Cockayne;J. Comb. Inf. Syst. Sci.,1993
3. Efficient Open Domination
4. Efficient open domination in Cayley graphs
5. Odd neighborhood transversals on grid graphs