Enrico L. Enriquez, Sergio R. Canoy
In this paper, we characterize the secure convex dominating sets in the lexicographic and Cartesian products of two connected graphs and then determine the corresponding secure convex domination numbers of these graphs. © 2015 Enrico L. Enriquez and Sergio R. Canoy, Jr.
Department of Mathematics, College of Arts and Sciences, University of San Carlos, Cebu City, 6000, Philippines; Department of Mathematics and Statistics, Mindanao State University, Iligan Institute of Technology, Tibanga Highway, Iligan City, 9200, Philippines
