Classification Graphs with Large Strong Roman Domination Number

G. Suresh Singh; Narges Mohsenitonekaboni

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

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

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

Classification Graphs with Large Strong Roman Domination Number

G. Suresh Singh, Narges Mohsenitonekaboni

Abstract

the function f :V  0 , 1 , 2 , 3 is named a Strong Roman dominating function on a graph G whenever for each vertex u with f  u   0 there exists an adjacent vertex v to u such that f  v   3 . Also for each vertex u with f  u   1 there should be at least one adjacent vertex v to u weight 2 . The weight of an SRDF is denoted as f V  and        u V f V f u . Strong Roman domination number of a graph G which we denoted by  G  SR  is minimum weight of an SRDF on G . In this paper, we characterize all connected graphs of order n with Strong Roman domination numbers 2 n  2 , 2 n  3 , 2 n  4 and 2 n  5 . Also we present the properties of connected graph of order n with Strong Roman domination number 2 n  6 .

Keywords

Strong Roman domination number, Strong Roman domination function.

References

[1] Chan, W. H., Chen, X. G., Shiu, W. (2010). Triangle-free graphs with large independent domination number. Discrete optimization, 86-92, 7.
[2] Haynes, T. W., Hedetniemi, S. T., and Slater, P. J. (1998). Fundamentals of domination in graphs, volume 208 of monographs and textbooks in pure and applied mathematics.
[3] Haynes, T. W., Hedetniemi, S. T., and Slater, P. J. (1998). Domination in graphs: advanced topics, volume 209 of monographs and textbooks in pure and applied mathematics.
[4] Henning, M. A. (2000). Graphs with Large total domination number. Journal of Graph Theory, 21-45.
[5] Selvakumar, K. and Kamaraj, M. (2016). Strong roman domination in graphs. International Journal of Mathematical Archive (IJMA) ISSN 2229-5046, 7(3).
[6] Singh, G. S., and Mohsenitonekaboni, N. (2017). Some properties on Strong Roman domination in graphs. August 17 Volume 5 Issue 8 , International Journal on Recent and Innovation Trends in Computing and Communication (IJRITCC), ISSN: 2321-8169, PP: 164 – 174.
[7] Singh, G. S. (2010). Graph Theory. PHI Learning Private Limited, New Delhi.

Citation :

G. Suresh Singh, Narges Mohsenitonekaboni, "Classification Graphs with Large Strong Roman Domination Number," International Journal of Mathematics Trends and Technology (IJMTT), vol. 49, no. 4, pp. 210-219, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V49P531