RESULTS ON MAJORITY DOM-CHROMATIC SETS OF A GRAPH

RESULTS ON MAJORITY DOM-CHROMATIC SETS OF A GRAPH

J. Joseline Manora, R. Mekala

[PDF]

Abstract

A majority dominating set S ⊆ V (G) is said to be majority dominating chromatic set if S satisfies the condition χ(⟨S⟩) = χ(G). The majority dom-chromatic number γMχ(G) is the minimum cardinality of majority dominating chromatic set. In this article we investigated some inequalities on Majority dominating chromatic sets of a connected and disconnected graph G. Also characterization theorems and some results on majority dom-chromatic number γMχ(G) for a vertex color critical graph and biparte graph are determined. we established the relationship between three parameters namely χ(G),γM(G) and γMχ(G) for some graphs.

Keywords

Majority dominating set, Majority dominating chromatic set, Majority dom- chromatic number.