Resolving Domination in Graphs under Some Binary Operations
-
Published:2023-01-29
Issue:1
Volume:16
Page:18-28
-
ISSN:1307-5543
-
Container-title:European Journal of Pure and Applied Mathematics
-
language:
-
Short-container-title:Eur. J. Pure Appl. Math.
Author:
Monsanto Gerald Bacon,Rara Helan
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.
Publisher
New York Business Global LLC
Subject
Applied Mathematics,Geometry and Topology,Numerical Analysis,Statistics and Probability,Algebra and Number Theory,Theoretical Computer Science