id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-4770	Mahistrado, Angelica Mae; Rara, Helen	$1$-movable $2$-Resolving Hop Domination in Graph	2023	16	.pdf	application/pdf	7302	427	79	A set S of vertices in G is a 1-movable 2-resolving hop dominating set of G if S is a 2-resolving hop dominating set in G and for every v ∈ S, either S\{v} is a 2-resolving hop dominating set of G or there exists a vertex u ∈ ( (V (G)\S) ∩NG(v) ) such that ( S\{v} ) ∪ {u} is a 2-resolving hop dominating set of G. The 1-movable 2-resolving hop domination number of G, denoted by γ1 m2Rh(G) is the smallest cardinality of a 1-movable 2- resolving hop dominating set of G. Recently, 2-resolving hop dominating sets in graphs was studied in [9].	cache/ejpam-4770.pdf	txt/ejpam-4770.txt