ON GRAPHS WITH EQUAL CHROMATIC TRANSVERSAL DOMINATION AND CONNECTED DOMINATION NUMBERS

Abstract

Let G = (V, E) be a graph with chromatic number ${\chi}(G)$. dominating set D of G is called a chromatic transversal dominating set (ctd-set) if D intersects every color class of every ${\chi}$-partition of G. The minimum cardinality of a ctd-set of G is called the chromatic transversal domination number of G and is denoted by ${\gamma}_{ct}$(G). In this paper we characterize the class of trees, unicyclic graphs and cubic graphs for which the chromatic transversal domination number is equal to the connected domination number.

Keywords

• domination number;
• connected domination number;
• chromatic transversal domination number

File

Download PDF

References

1. S. Arumugam and J. P. Joseph, On graphs with equal domination and connected domination numbers, Discrete Math. 206 (1999), no. 1-3, 45-49. https://doi.org/10.1016/S0012-365X(98)00390-2
2. S. K. Ayyaswamy and C. Natarajan, On graphs whose chromatic transversal number is two, Proyecciones 30 (2011), no. 1, 59-64. https://doi.org/10.4067/S0716-09172011000100006
3. X.-G. Chen, L. Sun, and H.-M. Xing, Characterization of graphs with equal domination and connected domination numbers, Discrete Math. 289 (2004), no. 1-3, 129-135. https://doi.org/10.1016/j.disc.2004.08.006
4. F. Harary, Graph Theory, Addison-Wesley, Reading Mass, 1969.
5. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
6. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Domination in Graphs, Advanced Topics, Marcel Dekker Inc., 1998.
7. L. B. Michaelraj, A Study on Chromatic Transversal Domination in graphs, (Ph. D Thesis), Bharathidasan University,Trichy, Tamilnadu, India, April 2008.
8. L. B. Michaelraj, S. K. Ayyaswamy, and S. Arumugam, Chromatic transversal domination in graphs, J. Combin. Math. Combin. Comput. 75 (2010), 33-40.