X− Dominating colour transversals in graphs
| Autor: | Venkatakrishnan Balasubramanian Yanamandram, C. Natarajan, S. K. Ayyaswamy |
|---|---|
| Jazyk: | English<br />Portuguese |
| Rok vydání: | 2016 |
| Předmět: | |
| Zdroj: | Boletim da Sociedade Paranaense de Matemática, Vol 34, Iss 2, Pp 99-105 (2016) |
| Druh dokumentu: | article |
| ISSN: | 0037-8712 2175-1188 |
| DOI: | 10.5269/bspm.v34i2.22997 |
| Popis: | 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. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|