In this paper, 2-hop domination parameter is introduced and investigated on some special graphs and on the join of two graphs. Characterizations of 2-hop dominating sets in some special graphs are formulated to derive bounds or formulas of the parameter of these graphs. Moreover, new variant of pointwise non-domination is introduced to characterize 2-hop dominating sets in the join of two graphs. This characterization is used to calculate the exact value of 2-hop domination number of the join of two graphs.
No takes yet. Share an insight, caveat, or question.
Hassan et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: