SUPER WEAKLY CONVEX DOMINATION IN GRAPHS
Enrico L. Enriquez, Reuella J. Bacalso · Journal of Global Research in Mathematical Archives(JGRMA) · 2019
: Let be a simple graph. A a weakly convex dominating set of is called super weakly convex dominating set of if for every vertex there exists a vertexsuch thatThe minimum cardinality of a super weakly convex dominating set of denoted by is called the super weakly convex domination number of In this paper, we initiate the study of the concept and give the domination number of some special graphs. Further, we characterize the super convex dominating set in join of two graphs.