DC Field | Value | Language |
---|---|---|
dc.contributor.author | Vaidya, S. K., | - |
dc.contributor.author | Parmar, A. D | - |
dc.date.accessioned | 2024-11-25T04:54:02Z | - |
dc.date.available | 2024-11-25T04:54:02Z | - |
dc.date.issued | 2019 | - |
dc.identifier.citation | Vaidya, S. K., & Parmar, A. D. (2019). On chromatic transversal domination in graphs. Malaya Journal of Matematik, 7(03), 419-422. | en_US |
dc.identifier.uri | http://10.9.150.37:8080/dspace//handle/atmiyauni/1987 | - |
dc.description.abstract | A proper k - coloring of a graph G is a function f : V (G) → {1, 2, ..., k} such that f (u) 6 = f (v) for all uv ∈ E(G). The color class Si is the subset of vertices of G that is assigned to color i. The chromatic number χ(G) is the minimum number k for which G admits proper k - coloring. A color class in a vertex coloring of a graph G is a subset of V (G) containing all the vertices of the same color. The set D ⊆ V (G) of vertices in a graph G is called dominating set if every vertex v ∈ V (G) is either an element of D or is adjacent to an element of D. If C = {S1, S2, ..., Sk} is a k - coloring of a graph G then a subset D of V (G) is called a transversal of C if D ∩ Si 6 = φ for all i ∈ {1, 2, ..., k}. A dominating set D of a graph G is called a chromatic transversal dominating set (cdt - set) of G if D is transversal of every chromatic partition of G. Here we prove some characterizations and also investigate chromatic transversal domination number of some graphs. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Malaya Journal of Matematik | en_US |
dc.subject | Coloring | en_US |
dc.subject | Domination, Chromatic Transversal Dominating Set. | en_US |
dc.title | SOME NEW RESULTS ON CHROMATIC TRANSVERSAL DOMINATION IN GRAPHS | en_US |
dc.type | Article | en_US |
Appears in Collections: | 01. Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
SOME NEW RESULTS ON CHROMATIC TRANSVERSAL.pdf | 190.59 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.