Resolving Restrained Domination in Graphs

Authors

  • Gerald Bacon Monsanto Visayas State University-Villaba
  • Helen M. Rara

DOI:

https://doi.org/10.29020/nybg.ejpam.v14i3.3985

Keywords:

dominating set, resolving set, resolving dominating set, resolving restrained dominating set, join, corona, lexicographic product

Abstract

Let G be a connected graph. Brigham et al. [3] defined a resolving dominating set
as a set S of vertices of a connected graph G that is both resolving and dominating. A set S ⊆ V (G) is a resolving restrained dominating set of G if S is a resolving dominating set of G and S = V (G) or hV (G) \ Si has no isolated vertex. In this paper, we characterize the resolving restrained dominating sets in the join, corona and lexicographic product of graphs and determine the resolving restrained domination number of these graphs.

Downloads

Published

2021-08-05

Issue

Section

Nonlinear Analysis

How to Cite

Resolving Restrained Domination in Graphs. (2021). European Journal of Pure and Applied Mathematics, 14(3), 829-841. https://doi.org/10.29020/nybg.ejpam.v14i3.3985

Similar Articles

1-10 of 397

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