A Review on Relationship between Domination,
Independent Transversal Domination and
Equitable Domination in Graphs

S.Surya; S.Maivizhiselvi

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

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 44 | Number 1 | Year 2017 | Article Id. IJMTT-V44P509 | DOI : https://doi.org/10.14445/22315373/IJMTT-V44P509

A Review on Relationship between Domination, Independent Transversal Domination and Equitable Domination in Graphs

S.Surya, S.Maivizhiselvi

Citation :

S.Surya, S.Maivizhiselvi, "A Review on Relationship between Domination, Independent Transversal Domination and Equitable Domination in Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 44, no. 1, pp. 51-52, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V44P509

Abstract

A set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V − S is adjacent to a vertex in S. A dominating set which intersects every maximum independent set in G is called an independent transversal dominating set. In this paper we begin an investigation of relationship between domination, independent transversal domination and equitable domination in graphs.

Keywords

Dominating set, independent set, independent transversal dominating set, equitable dominating set.

References

[1] G. Chartrand and L. Lesniak, Graphs and Digraphs Fourth edition, CRC Press, Boca Raton, 2005.
[2] E.J. Cockayne, R.M. Dawes and S.T. Hedetneimi, Total domination in graphs, Networks 10 211–219.
[3] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs (Marcel Dekker, New York, 1998).
[4] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Domination in Graphs: Advanced Topics ,Marcel Dekker, New York, 1998.
[5] Topics on Domination, Guest Editors: S.T. Hedetniemi and R.C. Laskar, Discrete Math. 86.
[6] E. Sampathkumar and H.B. Walikar, The connected domination number of a graph, J. Math. Phys. Sci. 13 607–613. Received 19 October 2009.
[7] N. Alon, The strong chromatic number of a graph, Random Structures and Algorithms 3 1–7.
[8] N. Alon, M. R. Fellows, and D. R. Hare, Vertex Transversals that Dominate, Journal of Graph Theory 21 (1) 21–31.
[9] S. K. Ayyaswamy and C. Natarajan, On graphs whose chromatic transversal number is two, Proyecciones 30 (1) 59–64.
[10] E. Boros, M.C. Golumbic, and V.E. Levit, On the number of vertices belonging to all maximum stable sets of a graph, Discrete Applied Mathematics 124 (2002) 17–25.