OUTER-CLIQUE DOMINATION IN THE CORONA AND CARTESIAN PRODUCT OF GRAPHS
Enrico L. Enriquez, Valerie Verallo Fernandez, Jovita N. Ravina · Journal of Global Research in Mathematical Archives(JGRMA) · 2018
Let G be a simple graph. A set S of vertices of a graph G is an outer-clique dominating set if every vertex not in S is adjacent to some vertex in S and the subgraph induced by V(G)\S is clique. In this paper, we give the characterization of the outer-clique dominating sets resulting from the corona and Cartesian product of two graphs and give their corresponding outer-clique domination number.