Resolving Restrained Domination in Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v14i3.3985Keywords:
dominating set, resolving set, resolving dominating set, resolving restrained dominating set, join, corona, lexicographic productAbstract
Let G be a connected graph. Brigham et al. [3] defined a resolving dominating set
as a set S of vertices of a connected graph G that is both resolving and dominating. A set S ⊆ V (G) is a resolving restrained dominating set of G if S is a resolving dominating set of G and S = V (G) or hV (G) \ Si has no isolated vertex. In this paper, we characterize the resolving restrained dominating sets in the join, corona and lexicographic product of graphs and determine the resolving restrained domination number of these graphs.
Downloads
Published
Issue
Section
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.