Restrained Strong Resolving Hop Domination in Graphs

Authors

  • Armalene Abragan Mindanao state university iligan institute of technology
  • Helen Rara

DOI:

https://doi.org/10.29020/nybg.ejpam.v15i4.4484

Keywords:

Restrained strong resolving hop dominating set, Restrained strong resolving hop domination number, Join, Corona, Lexicographic product

Abstract

A set S ⊆ V (G) is a restrained strong resolving hop dominating set in G if for every v ∈ V (G)\S, there exists w ∈ S such that dG(v, w) = 2 and S = V (G) or V (G)\S has no isolated vertex. The smallest cardinality of such a set, denoted by γrsRh(G), is called the restrained strong resolving hop domination number of G. In this paper, we obtained the corresponding parameter in graphs resulting from the join, corona and lexicographic product of two graphs. Specifically, we characterize the restrained strong resolving hop dominating sets in these types of graphs and determine the bounds or exact values of their restrained strong resolving hop domination numbers.

Downloads

How to Cite

Abragan, A., & Rara, H. (2022). Restrained Strong Resolving Hop Domination in Graphs. European Journal of Pure and Applied Mathematics, 15(4), 1472–1481. https://doi.org/10.29020/nybg.ejpam.v15i4.4484

Most read articles by the same author(s)