X− Dominating colour transversals in graphs
Open Access
- 29 June 2015
- journal article
- Published by Sociedade Paranaense de Matemática in Boletim da Sociedade Paranaense de Matemática
- Vol. 34 (2) , 99-105
Abstract
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 is a transversal of at least one $chi$−partition of G.The minimum cardinal- ity of a X−dominating colour transversal set is called X−dominating colour transversal number and is denoted by $chi_{dct}(G)$. We find the bounds of X−dominating colour transversal number and characterize the graphs attaining the bound.
Keywords
This publication has 1 reference indexed in Scilit:
- Bipartite theory of irredundant setProyecciones (Antofagasta), 2011