On Strong Resolving Domination in the Join and Corona of Graphs

Authors

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

DOI:

https://doi.org/10.29020/nybg.ejpam.v13i1.3625

Keywords:

strong resolving dominating set, strong resolving domination number, join, corona

Abstract

Let G be a connected graph. A subset S \subseteq V(G) is a strong resolving dominating set of G if S is a dominating set and for every pair of vertices u,v \in V(G), there exists a vertex w \in S such that u \in I_G[v,w] or v \in I_G[u,w]. The smallest cardinality of a strong resolving dominating set of G is called the strong resolving domination number of G. In this paper, we characterize the strong resolving dominating sets in the join and corona of graphs and determine the bounds or exact values of the strong resolving domination number of these graphs.

Downloads

Published

2020-01-31

Issue

Section

Nonlinear Analysis

How to Cite

On Strong Resolving Domination in the Join and Corona of Graphs. (2020). European Journal of Pure and Applied Mathematics, 13(1), 170-179. https://doi.org/10.29020/nybg.ejpam.v13i1.3625

Similar Articles

1-10 of 482

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