Enrico L. Enriquez, Edward M. Kiunisala
In [6], Enriquez and Kiunisala showed that every integers k, m, and n with 1 ≤ k ≤ m < n is realizable as inverse domination number, inverse secure domination number, and order of G respectively and gave the characterization of the inverse secure dominating set with inverse secure domination number of one and two. In this paper, we characterize the inverse secure dominating sets in the join and corona of two graphs and give some important results. © Research India Publications.
Department of Mathematics, School of Arts and Sciences, University of San Carlos, Cebu City, 6000, Philippines; Mathematics Department, College of Arts and Sciences, Cebu Normal University, Cebu City, 6000, Philippines
