Restrained 2-Resolving Dominating Sets in the Join, Corona and Lexicographic Product of Two Graphs

Authors

  • Jean Mansanadez Cabaro Mindanao State University-Marawi
  • Helen Rara MSU-IIT

DOI:

https://doi.org/10.29020/nybg.ejpam.v15i3.4451

Keywords:

Restrained 2-resolving set, restrained 2-resolving dominating set, lexicographic product of two graphs

Abstract

Let G be a connected graph. An ordered set of vertices {v1, ..., vl} is a 2-resolving set for G if, for any distinct vertices u, w ∈ V (G), the lists of distances (dG(u, v1), ..., dG(u, vl)) and (dG(w, v1), ..., dG(w, vl)) differ in at least 2 positions. A set S ⊆ V (G) is a restrained 2-resolving dominating set in G if S is a 2-resolving dominating set in G and S = V (G) or ⟨V (G)\S⟩ has no isolated vertex. The restrained 2R-domination number of G, denoted by γr2R(G), is the smallest cardinality of a restrained 2-resolving dominating set in G. Any restrained 2-resolving dominating set of cardinality γr2R(G) is referred to as a γr2R-set in G. This study deals with the concept of restrained 2-resolving dominating set of a graph. It characterizes the restrained 2-resolving dominating set in the join, corona and lexicographic product of two graphs and determine the bounds or exact values of the restrained 2-resolving domination number of these graphs.

Author Biographies

  • Jean Mansanadez Cabaro, Mindanao State University-Marawi

    Faculty, Mathematics Department, College of Natural Sciences and Mathematics, Mindanao State University-Main Campus, 9700 Marawi City, Philippines

  • Helen Rara, MSU-IIT

    Faculty, Department of Mathematics and Statistics, College of Science and Mathematics, Center of Graph Theory, Algebra, and Analysis-Premier Research Institute of Science and Mathematics, Mindanao State University-Iligan Institute of Technology, 9200 Iligan City, Philippines

Downloads

Published

2022-07-31

Issue

Vol. 15 No. 3: (July 2022)

Section

Nonlinear Analysis

License

Copyright (c) 2022 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

Restrained 2-Resolving Dominating Sets in the Join, Corona and Lexicographic Product of Two Graphs. (2022). European Journal of Pure and Applied Mathematics, 15(3), 1047-1053. https://doi.org/10.29020/nybg.ejpam.v15i3.4451