On Restrained Strong Resolving Domination in Graphs

Authors

  • Helyn Cosinas Sumaoy Mindanao State University - Iligan Institute of Technology
  • Helen M. Rara Center of Graph Theory, Algebra, and Analysis-Premier Research Institute of Science and Mathematics, Mindanao State University-Iligan Institute of Technology

DOI:

https://doi.org/10.29020/nybg.ejpam.v14i4.4112

Keywords:

restrained strong resolving dominating set, restrained strong resolving domination number, join, corona, lexicographic product

Abstract

A set S ⊆ V (G) is a restrained strong resolving dominating set in G if S is a strong
resolving dominating set in G and S = V (G) or ⟨V (G) \ S⟩ has no isolated vertex. The restrained strong resolving domination number of G, denoted by γrsR(G), is the smallest cardinality of a restrained strong resolving dominating set in G. In this paper, we present characterizations of the restrained strong resolving dominating sets in the join, corona and lexicographic product of two graphs and determine the exact value of the restrained strong resolving domination number of each of these graphs.

Author Biography

  • Helen M. Rara, Center of Graph Theory, Algebra, and Analysis-Premier Research Institute of Science and Mathematics, Mindanao State University-Iligan Institute of Technology

    Department of Mathematics and Statistics

    Professor VI

Downloads

Published

2021-11-10

Issue

Section

Nonlinear Analysis

How to Cite

On Restrained Strong Resolving Domination in Graphs. (2021). European Journal of Pure and Applied Mathematics, 14(4), 1367-1378. https://doi.org/10.29020/nybg.ejpam.v14i4.4112

Similar Articles

1-10 of 555

You may also start an advanced similarity search for this article.