id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-3484	Armada, Cris Laquibla; Canoy, Sergio, Jr. R.	Forcing Independent Domination Number of a Graph	2019	11	.pdf	application/pdf	5331	372	91	, n−4 3 } and k < p ≤ n−1 3 , Si ∩N(Si) = ∅ and |Si| = dn 3 e, that is, Si and Sk,p are γi-sets of Pn and u3 ∈ S1\(S2 ∪ Sk,p). W.l.o.g., suppose that G has a unique γi-set, say S. Then by Corollary 3.7, S and the γi-sets of H are γi-sets of G+H. Clearly, for any x ∈ S, {x} is uniquely contained in S and not in any γi-set of G+H. By Remark 3.1(ii), fγi(S)	cache/ejpam-3484.pdf	txt/ejpam-3484.txt