id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-6939	Aradais, Alkajim ; Jamil, Ferdinand; Canoy, Sergio Jr.	Connected Disjunctive Domination in Graphs	2025	14	.pdf	application/pdf	6896	530	82	A set S of vertices of a graph G is a disjunctive dominating set if for every v ∈ V (G)\S, v is adjacent to a vertex in S or S contains two vertices each of distance two from v. A disjunctive dominating set For a graph G, the symbols V (G) and E(G) refer to the vertex-set and edge-set, respectively, of G. For S ⊆ V (G), |S| is the cardinality of S.	cache/ejpam-6939.pdf	txt/ejpam-6939.txt