id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-3998	Ahmad, Eman Camad; Malacas, Gina Alquiza; Canoy, Sergio Jr. Rosales	Stable Locating-Dominating Sets in Graphs	2021	12	.pdf	application/pdf	6638	462	83	A set S is a stable locating-dominating set of G+H if and only if S = SG ∪ SH and SG and SH are stable locating sets of G and H, respectively, and at least one of them is a stable strictly locating set or both of them are strictly locating sets. Therefore, SG is a strictly locating set of G. Similarly, SH is a strictly locating set of H. Conversely, suppose that S = SG∪SH and SG and SH are stable locating sets of G and H, respectively, such that at least one of them is a stable strictly locating set or both of them are strictly locating sets.	cache/ejpam-3998.pdf	txt/ejpam-3998.txt