On Restrained Strong Resolving Domination in Graphs
-
Published:2021-11-10
Issue:4
Volume:14
Page:1367-1378
-
ISSN:1307-5543
-
Container-title:European Journal of Pure and Applied Mathematics
-
language:
-
Short-container-title:Eur. J. Pure Appl. Math.
Author:
Sumaoy Helyn Cosinas,Rara Helen M.
Abstract
A set S ⊆ V (G) is a restrained strong resolving dominating set in G if S is a strongresolving dominating set in G and S = V (G) or ⟨V (G) \ S⟩ has no isolated vertex. The restrained strong resolving domination number of G, denoted by γrsR(G), is the smallest cardinality of a restrained strong resolving dominating set in G. In this paper, we present characterizations of the restrained strong resolving dominating sets in the join, corona and lexicographic product of two graphs and determine the exact value of the restrained strong resolving domination number of each of these graphs.
Publisher
New York Business Global LLC
Subject
Applied Mathematics,Geometry and Topology,Numerical Analysis,Statistics and Probability,Algebra and Number Theory,Theoretical Computer Science
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. 1-Movable Resolving Hop Domination in Graphs;European Journal of Pure and Applied Mathematics;2023-01-29
2. Cliques and Supercliques in Graphs;European Journal of Pure and Applied Mathematics;2023-01-29
3. Restrained Strong Resolving Hop Domination in Graphs;European Journal of Pure and Applied Mathematics;2022-10-31
4. Supercliques in a Graph;European Journal of Pure and Applied Mathematics;2022-07-31