Dom-chromatic Number of certain graphs

Authors

  • Usha P Department of Mathematics, D.G. Vaishnav College, Chennai, India
  • Punitha Jm Department of Mathematics, Bharathi Women’s College, Chennai, India
  • Angeline EF Department of Mathematics, Nazareth College of Arts and Science, Chennai, India

Keywords:

Dominating set, Dom-colouring set, Star graphs,, Windmill graphs, Ladder graphs, Comb graphs

Abstract

For a given -coloring of a graph , a dominating set is said to be dom-colouring set if it contains at least one vertex from each colour class of G. The dom-chromatic number is the minimal cardinality taken over all domcolouring sets and is denoted by . In this paper we have obtained the dom-chromatic number of various types of graphs like star graphs, windmill graphs, ladder graphs, comb graphs and for cycles

References

[1] C. Berge, “Theory of Graphs and its Applications”, Methuen, London, 1962.

[2] Ore. O, “Theory of Graphs”, American Mathematical Society Colloquium Publication 38 (American Mathematical Society Providence RI) 1962.

[3] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, “Fundamentals of Domination in graphs,” Marcel Decker, Inc, New York 1997.

[4] B. Chaluvaraju, C. AppajiGowda, “The Neighbour Colouring Set in Graphs,” International Journal of Applied Mathematics and Computation, pp.301-311, 2012.

[5] T. R. Jensen and B. Toft, “Graph Coloring Problem,” John Wiley & Sons, Inc, New York 1995.

[6] E. Sampathkumar and G. D. Kamath, “A Generalization of Chromatic Index,” Discrete Mathematics 124, pp.173-177, 1994.

[7] T.W.Haynes, S.T.Hedetniemi, P.J. Slater, “Fundamentals of Domination in Graphs,” Marcel Dekker, New York, 1998.

[8] T.W.Haynes, S.T.Hedetniemi, P.J. Slater, “Domination in Graphs,” Advanced topics, Marcel Dekker, New York, 1998.

[9] H.B. Waliker, B.D. Acharya, E. Sampath Kumar, “Recent Devel-opments in the Theory of Domination in Graphs,” In:MRI Lecture Notes in Mathematics, Allahabad, The Mehta Research Institute of Mathematics and Mathematical Sciences, 1979.

[10] H. Hosoya, F.Harary, “On the Matching Properties of Three Fence Graphs,” Journal of Mathematical Chemistry, pp. 211-218, 1993.

[11] D. Frank Hsu, “Harmonious Labeling of Windmill Graphs and Related Graphs,” Spring, 1982.

[12] S. Sandhya, C. David Rai, C.Jayasekaran, “Some New Results on Harmonic Mean Graphs,” International Journal of Mathematics Archive, 2013

Downloads

Published

2025-11-25

How to Cite

[1]
P. Usha, J. M. Punitha, and B. E. Angeline, “Dom-chromatic Number of certain graphs”, Int. J. Comp. Sci. Eng., vol. 7, no. 5, pp. 198–202, Nov. 2025.

Issue

Vol. 7 No. 5 (2019): IJCSE Special Issue Mar Edition

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.