WEAKLY CONVEX DOUBLY CONNECTED DOMINATION IN GRAPHS UNDER SOME BINARY OPERATIONS
Rujube N. Hinoguin, Enrico L. Enriquez · 2018
L et be a connected simple graph. A weakly convex dominating set of is a weakly convex doubly connected dominating set if is a doubly connected dominating set of . The weakly convex doubly connected domination number of , denoted by is the smallest cardinality of a convex doubly connected dominating set of . In this paper, we characterized the weakly convex doubly connected dominating sets of the composition and Cartesian product of graphs.