Outer-connected Hop Dominating Sets in Graphs
Keywords:hop domination, outer-connected, join, corona, lexicographic product
Let G be an undirected graph with vertex and edge sets V (G) and E(G), respectively. A hop dominating set S ⊆ V (G) is called an outer-connected hop dominating set if S = V (G) or the subgraph ⟨V (G) \ S⟩ induced by V (G) \ S is connected. The minimum size of an outer-connected hop dominating set is the outer-connected hop domination number γfch(G). A dominating set
of size γfch(G) of G is called a γfch-set. In this paper, we investigate the concept and study it for graphs resulting from some binary operations. Specifically, we characterize the outer-connected hop dominating sets in the join, corona and lexicographic products of graphs, and determine bounds of the outer-connected hop domination number of each of these graphs.
How to Cite
Copyright (c) 2022 European Journal of Pure and Applied Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International 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.