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

Vol. 16 No. 1: (January 2023)

Section

Nonlinear Analysis

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 European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.

By agreeing to this statement, you acknowledge that:

  • You retain full copyright over your work.
  • The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
  • This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.

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