TY - JOUR
AU - Nanding, Sandra Abo
AU - Rara, Helen
PY - 2021/11/10
Y2 - 2023/11/29
TI - On Connected Co-Independent Hop Domination in Graphs
JF - European Journal of Pure and Applied Mathematics
JA - Eur. J. Pure Appl. Math.
VL - 14
IS - 4
SE -
DO - 10.29020/nybg.ejpam.v14i4.4069
UR - https://ejpam.com/index.php/ejpam/article/view/4069
SP - 1226-1236
AB - Let G be a connected graph. A subset S of V (G) is a connected co-independent hop dominating set in G if the subgraph induced by S is connected and V (G)\S is an independent set where for each v âˆˆ V (G)\S, there exists a vertex u âˆˆ S such that dG(u, v) = 2. The smallest cardinality of such an S is called the connected co-independent hop domination number of G. This paper presents the characterizations of the connected co-independent hop dominating sets in the join, corona and lexicographic product of two graphs. It also discusses the corresponding connected co-independent hop domination numbers of the aforementioned graphs.
ER -