On Connected Co-Independent Hop Domination in Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v14i4.4069Keywords:
connected co-independent hop dominating set, connected co-independent hop domination number, strictly co-independent set, strictly co-independent number, join, corona, lexicographic productAbstract
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.Downloads
Published
2021-11-10
Issue
Section
Nonlinear Analysis
License
Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.
European Journal of Pure and Applied Mathematics will be Copyright Holder.
How to Cite
On Connected Co-Independent Hop Domination in Graphs. (2021). European Journal of Pure and Applied Mathematics, 14(4), 1226-1236. https://doi.org/10.29020/nybg.ejpam.v14i4.4069