id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-3763	Paleta, Leonard Mijares; Jamil, Ferdinand Paler	More on Perfect Roman Domination in Graphs	2020	20	.pdf	application/pdf	9716	858	95	A perfect Roman dominating function on a graph G = (V (G), E(G)) is a function f : V (G) → {0, 1, 2} for which each u ∈ V (G) with f(u) = 0 is adjacent to exactly one vertex v ∈ V (G) with f(v) The join of G and H is the graph G+H with vertex set V (G)∪V (H) and edge set E(G)∪E(H)∪{uv : u ∈ V (G), v ∈ V (H)}.	cache/ejpam-3763.pdf	txt/ejpam-3763.txt