id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-4963	Caay, Mark; Hernandez, Andrew	Perfect Equitable Isolate Dominations in Graphs	2024	10	.pdf	application/pdf	4853	355	82	A subset S ⊆ V (G) is said to be a perfect equitable isolate dominating set of a graph G if it is both perfect equitable dominating set of G and isolate dominating set of G. The minimum cardinality of a perfect equitable isolate dominating set is called perfect equitable isolate domination number of G and is denoted by γpe0(G). A dominating set S ⊆ V (G) is said to be a perfect equitable isolate dominating set (PEID) of G if it is both perfect equitable isolate dominating set.	cache/ejpam-4963.pdf	txt/ejpam-4963.txt