On graphs whose chromatic transversal domination number is two

• Ayyaswamy, S. K. ^[1] ; Natarajan, C. ^[1]
  1. [1] SASTRA University

     SASTRA University

     India

     
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 30, Nº. 1, 2011, págs. 59-64
• Idioma: inglés
• DOI: 10.4067/S0716-09172011000100006
• Enlaces
  • Texto completo
• Resumen

  • In this paper we characterize the class of trees, block graphs, cactus graphs and cubic graphs for which the chromatic transversal domination number is equal to two.

• Referencias bibliográficas
  • Citas [1] L. Benedict Michaelraj, S. K. Ayyaswamy and S. Arumugam, Chromatic transversal domination in graphs; J. Comb. Math. Comb. Comput....
  • [2] L. Benedict Michaelraj, A Study on Chromatic Transversal Domination in graphs; (Ph.d Thesis), Bharathidasan University, Trichy, Tamilnadu,...
  • [3] T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in graphs, Marcel Dekker, New York, (1998).