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

How to Cite

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

Issue

Vol. 16 No. 1: (January 2023)

License

Copyright (c) 2023 European Journal of Pure and Applied Mathematics

Creative Commons License

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.