X− Dominating colour transversals in graphs
Yanamandram Balasubramanian Venkatakrishnan, Chidambaram Natarajan, S. K. Ayyaswamy · Boletim da Sociedade Paranaense de Matemática · 2015
Let G = (X, Y,E) be a bipartite graph. A X-dominating set D ⊆X is called a X−dominating colour transversal set of a graph G if D isa transversal of at least one $chi$−partition of G.The minimum cardinal-ity of a X−dominating colour transversal set is called X−dominatingcolour transversal number and is denoted by $chi_{dct}(G)$. We find thebounds of X−dominating colour transversal number and characterizethe graphs attaining the bound.