Advances and Applications in Discrete Mathematics
Volume 31, , Pages 87 - 100
(May 2022) http://dx.doi.org/10.17654/0974165822027 |
|
RESTRAINED STRICTLY LOCATING-DOMINATION IN GRAPHS
Stephanie O. Espinola
|
Abstract: Let G be a simple connected graph. A non-empty subset S of is a strictly locating-dominating set in G if it is a dominating set in G and for every two distinct vertices and for all A strictly locating-dominating set is a restrained strictly locating-dominating set in G if or has no isolated vertex. The restrained strictly locating-domination number of G, denoted by is the smallest cardinality of a restrained strictly locating-dominating set in G.
|
Keywords and phrases: locating-domination, strictly locating-domination, restrained strictly locating-domination.
|
|
Number of Downloads: 41 | Number of Views: 92 |
|