id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-6065	Armada, Cris L.; M. Kiunisala, Edward; Rosero, Cristopher John S.; Malusay, Jeneveb T.	Forcing Clique Domination in Graphs	2025	14	.pdf	application/pdf	6182	477	86	Connected graphs with forcing clique domination number equal to 0, 1, or a, where a is greater than 1 but less than the clique domination number, are characterized. A subset S of V (G+H) is a clique dominating set of G+H if and only if one of the following statements holds: (i) S is clique dominating set of G (ii) S is a clique dominating set of H. (iii) S = S1 ∪ S2, where ⟨S1⟩ and ⟨S2⟩ are cliques in G and H, respectively.	cache/ejpam-6065.pdf	txt/ejpam-6065.txt