id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-4187	Malalay, Rolando Penafiel; Jamil, Ferdinand Paler	Restrained Disjunctive Domination in Graphs under Some Binary Operations	2022	17	.pdf	application/pdf	9215	609	85	If u is the end vertex of graph G and degG(v) ≤ 2, then u ∈ S for all restrained disjunctive dominating sets S of G. Proposition 1. Under the same condition, the minimum of the sets between disjuntive total domination number of graph G and twice of distance-2 domination number of graph G, denoted by min{γdt (G), 2γ2(G)} proves to be a sharp bound for the restrained disjunctive domination number of the lexicographic product of graphs G and H. REFERENCES 222 Acknowledgements This research was undertaken at the Technische Universitat Kaiserslautern, Germany, under the Faculty and Student Exchange Program of the project ”Graph Theory and Optimization (GraThO) with Applications in Industry and Society” and funded by the Zamboanga Peninsula Polytechnic State University, Philippines.	cache/ejpam-4187.pdf	txt/ejpam-4187.txt