Jonecis A. Dayap, Enrico L. Enriquez
Let G be a connected simple graph. A set S of vertices of a graph G is an outer-convex dominating set if every vertex not in S is adjacent to some vertex in S and V (G)/S is a convex set. The outer-convex domination number of G, denoted by γcon(G), is the minimum cardinality of an outer-convex dominating set of G. An outer-convex dominating set of cardinality γcon(G) will be called a γcon-set. In this paper, we initiate the study and characterize the outer-convex dominating sets in the join of the two graphs. © 2020 World Scientific Publishing Company.
Department of Mathematics and Sciences, College of Arts and Sciences, University of San Jose-Recoletos, Cebu City, 6000, Philippines; Department of Mathematics, School of Arts and Sciences, University of San Carlos, Cebu City, 6000, Philippines
