id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-5749	Bullang, Brayan; Aniversario, Imelda ; Aradais, Alkajim ; Jamil, Ferdinand	Semitotal Roman Domination in Graphs	2025	15	.pdf	application/pdf	7577	595	91	= 0, there exists u ∈ V (G) for which f(u) = 2 and uv ∈ E(G) and for each v ∈ V (G) with f(v) ̸= 0, there exists u ∈ V (G) for which f(u) ̸= 0 and dG(u, v) ≤ 2. As usual, the symbols V (G) and E(G) denote the vertex set and edge set, respectively, of G. For S ⊆ V (G), |S| is the cardinality of S. In particular, |V (G)| and |E(G)| are the order and size, respectively, of G. Given two graphs G and H with disjoint vertex sets, the join G+H of G and H is the graph with vertex set V (G)∪V (H) and edge set E(G) ∪ E(H)∪{uv : u ∈ V (G) and v ∈ V (H)}.	cache/ejpam-5749.pdf	txt/ejpam-5749.txt