• CHROMATIC WEAKLY CONVEX DOMINATION OF SOME FAMILIES OF GRAPH

E. HELENA*, R. POOVAZHAKI

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.


Keywords


Central graph, Middle graph, Total graph, Chromatic number, Chromatic Weakly Convex dominating set.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2020 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter