Resolving Domination in Graphs under Some Binary Operations
Keywords:resolving dominating set, resolving domination number, join, corona, lexicographic product
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.
Copyright (c) 2023 European Journal of Pure and Applied Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.
European Journal of Pure and Applied Mathematics will be Copyright Holder.