• CHROMATIC WEAKLY CONVEX DOMINATION OF SOME FAMILIES OF GRAPH

Abstract

A chromatic weakly convex dominating set is defined as follows: A Weakly convex dominating set D of a graph is said to be a Chromatic weakly convex dominating set if . A Chromatic weakly convex domination number of G is the minimum cardinality of a Chromatic weakly convex dominating set. This parameter was introduced in [5]. This paper further extends the study by obtaining the Chromatic weakly convex domination number of central, middle and total graph of complete bipartite graph.