MAJORITY DOM- CHROMATIC SET OF A GRAPH

Abstract

This paper introduces majority dominating chromatic set of a graph G. The Majority Dom – Chromatic number (G) of G is investigated for some classes of graphs. Also Bounds of  (G) and the relationship between other graph parameters are studied.