MAJORITY DOM- CHROMATIC SET OF A GRAPH

J Joseline Manora; R Mekala

doi:10.48165/

Authors

J Joseline Manora Associate Professor, P.G. & Research Department of Mathematics, Tranquebar Bishop Manikam Luthern College, Porayar, Tamil Nadu 609307, India.
R Mekala Research Scholar, Department of Mathematics, E.G.S. Pillai Arts and Science College, Nagapattinam, Tamil Nadu 611002 , India.

DOI:

https://doi.org/10.48165/

Keywords:

Dom-Chromatic Set, Majority Dom – Chromatic number

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.

References

Berge, C. (1962). Theory of graphs and its Applications, Methuen, London 1962. [2] Chaluvaraju, B. and Appajigowda, C. (2016). The Dom – Chromatic Number of a Graph, Malaya Journal of Matematik, 4(1), 1-7.

Harary, F. (1969). Graph Theory, Addison – Wesley, Reading Mass.

Haynes, T.W., Hedetniemi Peter, S.T. and Slater, J. (1998). Fundamentals of Domination in Graphs, Marcel Dekker Inc, New York.

Jankiraman, T.N. and Poobalaranjani, M. (2011). Dom – Chromatic sets of Graphs, International

Journal of Engineering Science, Advanced Computing and Bio –Technology, Vol. 2, No.2, April – June 2011, 88-103.

Joseline Manora, J. and Swaminathan, V. (2011). Results on Majority Dominating Sets, Scientia Magna (Dept. of Mathematics, Northwest University, X’tian, P.R. China), Vol. 7, No. 3, 53-58. [7] Joseline Manora, J. and Swaminathan, V. (2006). Majority Dominating Sets in Graphs – I, Jamal Academic Research Journal, Vol.3, No. 2, 75-82.

Ore, O. (1962). Theory of graphs, Amer. Math. Soc. Colloq. Publ.38, American Mathematical Society, RI.