Changing And Unchanging Properties Of
Single Chromatic Transversal
Domination Number Of Graphs

J. Felix; E. Litta; L.Benedict Michael Raj

doi:https://doi.org/10.14445/22315373/IJMTT-V52P539

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 52 | Number 4 | Year 2017 | Article Id. IJMTT-V52P539 | DOI : https://doi.org/10.14445/22315373/IJMTT-V52P539

Changing And Unchanging Properties Of Single Chromatic Transversal Domination Number Of Graphs

J. Felix , E. Litta, L.Benedict Michael Raj

Citation :

J. Felix , E. Litta, L.Benedict Michael Raj, "Changing And Unchanging Properties Of Single Chromatic Transversal Domination Number Of Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 52, no. 4, pp. 262-266, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V52P539

Abstract

G = (V, E) is called a dominating set if for every vertex v ∈ V − D, there exists a vertex u ∈ D such that u and v are adjacent. The cardinality of a minimum dominating set is called the domination number of a graph and is denoted by γ(G). A dominating set D is called a single chromatic transversal dominating set if D intersects every member (color class) of some chromatic partition, also called χ-partition of G.This set is called an std-set. The cardinality of a minimum std-set is called the single chromatic transversal domination number of a graph G and is denoted by γst(G). The effect of the removal of an edge, a vertex or an addition of an edge of a graph over the γst value is studied.

Keywords

Domination number, single chromatic transversal domination number.

References

[1] L.Benedict Michael Raj, S.K. Ayyaswamy and S. Arumugam,Chromatic Transversal Domination in Graphs, J. Comb. Math. Comb. Comput 75(2010),33-40.
[2] L.Benedict Michael Raj, S.K. Ayyaswamy and I. Sahul Hamid, Chromatic Transversal Domatic number of Graphs, International Mathematical Forum,5,(2010),(no.13),639-648.
[3] J.Felix, E. Litta and L.Benedict Micheal Raj Single chromatic transversal domination number of graphs, Communicated
[4] Gary Chatrand, LB Leisnaik Graph and Digraphs , Addison-Wesley, Reading Mass.1969.
[5] T.W.Hayanes, S.T. Hedetniemi and P.J. Slater,Fundametals of Domination in Graphs,Marcel Dekker Inc.1998.
[6] T.W.Haynes, S.T. Hedetniemi and P.J. Slater,Domination in Graphs advanced topics , Marcel Dekker Inc.1998.
[7] R.Lawrence Joseph Manoharan, S.K.Ayyaswamy and L.Benedict Micheal Raj, Dominating Chromatic Transversal number of graphs,European Journal of Scientific Research, 83(2012),344-348.