Open AccessOn Restrained Strong Resolving Domination in Graphs
Author(s) -
Helyn Cosinas Sumaoy,
Helen M. Rara
Publication year - 2021
Publication title -
european journal of pure and applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.245
H-Index - 5
ISSN - 1307-5543
DOI - 10.29020/nybg.ejpam.v14i4.4112
Subject(s) - dominating set , mathematics , lexicographical order , combinatorics , domination analysis , vertex (graph theory) , cardinality (data modeling) , graph , set (abstract data type) , discrete mathematics , computer science , data mining , programming language
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.