Resolving Domination in Graphs under Some Binary Operations

Authors

  • Gerald Bacon Monsanto Visayas State University-Villaba
  • Helan Rara

DOI:

https://doi.org/10.29020/nybg.ejpam.v16i1.4643

Keywords:

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

Abstract

In this paper, we investigate the concept of resolving dominating set in a graph. In particular, we characterize the resolving dominating sets in the join, corona and lexicographic product of two graphs and determine the resolving domination number of these graphs.

Downloads

Published

2023-01-29

Issue

Section

Nonlinear Analysis

How to Cite

Resolving Domination in Graphs under Some Binary Operations. (2023). European Journal of Pure and Applied Mathematics, 16(1), 18-28. https://doi.org/10.29020/nybg.ejpam.v16i1.4643