id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-4894	Hamja, Jamil	Certified Perfect Domination in Graphs	2023	12	.pdf	application/pdf	5121	394	81	A perfect dominating set S ⊆ V (G) is called certified perfect dominating set of G if every u ∈ S has either zero or at least two neighbors in Math, 16 (4) (2023), 2763-2774 2764 In 1990, Livingston M. et.al, investigated the concept of perfect dominating set of a graph.	cache/ejpam-4894.pdf	txt/ejpam-4894.txt