X− Dominating colour transversals in graphs | Zendy

Y. B. Venkatakrishnan | Zendy; C. Natarajan | Zendy; S. K. Ayyaswamy | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

X− Dominating colour transversals in graphs

Author(s) -

Y. B. Venkatakrishnan,

C. Natarajan,

S. K. Ayyaswamy

Publication year - 2015

Publication title -

boletim da sociedade paranaense de matemática

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.347

H-Index - 15

eISSN - 2175-1188

pISSN - 0037-8712

DOI - 10.5269/bspm.v34i2.22997

Subject(s) - transversal (combinatorics) , combinatorics , bipartite graph , mathematics , dominating set , graph , partition (number theory) , discrete mathematics , mathematical analysis , vertex (graph theory)

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research