On Steiner Domination Number of Graphs

K. Ramalakshmi; K. Palani

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

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 41 | Number 2 | Year 2017 | Article Id. IJMTT-V41P517 | DOI : https://doi.org/10.14445/22315373/IJMTT-V41P517

On Steiner Domination Number of Graphs

K. Ramalakshmi, K. Palani

Abstract

For a connected graph G, a set of vertices W in G is called a Steiner dominating set if W is both a Steiner set and a dominating set. The minimum cardinality of a Steiner dominating set of G is its Steiner domination numberand is denoted by . In this paper, it is studied that how the Steiner domination number is affected by adding a single edge to paths, complete graphs, cycles, star and wheel graph. Also, it is studied that how it is affected by deleting edges from complete graphs.

Keywords

Domination, Steiner number and Steiner domination number.

References

[1] G. Chatrand and P. Zhang,The Steiner number of a graph, Discrete Math., 242(2002),41–54.
[2] T.W. Haynes, S.T. Hedetniemi and P.J. Slater,Fundamentals of Domination in graphs, Marcel Decker, Inc., New York, 1998.
[3] J. John, G. Edwin and P. Paul Sudhahar, The Steiner domination number of a graph, International Journal of Mathematics and Computer Applications Research, 3(3)(2013), 37–42.
[4] Ore and Berge, Theory of Graphs, American Mathematical Society, Colloquium PublicationsXXXVIII, 1962.
[5] K. Palani and A. Nagarajan, (G,D)- number of a graph, International Journal of MathematicsResearch, 3(3)(2011), 285–299.
[6] K. Palani and A. Nagarajan,(G,D)-Number of edge added graphs, Enrich - Research Journal,ISSN 2319-6394 - Communicated.
[7] K. Palani and A. Nagarajan, (G,D)-Number of edge deleted graphs, Enrich - Research Journal, ISSN 2319-6394 Communicated.
[8] K. Ramalakshmi, K. Palani and T. TamizhChelvam, Steiner Domination Number of Graphs,Proceedings of International Conference on Recent Trends in Mathematical Modeling, ISBN13-978-93-82592-00-06, pp.128-134.
[9] S.K.Vaidya and R.N.Mehta, Steiner domination number of some wheel related graphs, International journal of Mathematics and soft computing, Vol.5, No.2(2015),15-19.

Citation :

K. Ramalakshmi, K. Palani, "On Steiner Domination Number of Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 41, no. 2, pp. 186-190, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V41P517