BOUNDS IN STRONG ROMAN DOMINATION
K. Selvakumar, Dr. M. Kamaraj
Abstract
This article presents sharp lower and upper bounds for γ_R(G) in term of diam (G). Recall that the eccentricity of vertex v in ecc (v) = max{d(u,w):w∈V} and the diameter of G is diam (G) = max{ ecc (v): v∈V}. It has been assumed throughout this article that G is a nontrivial graph of order n≥ 2. ‘Bounds on Roman domination number of a graph G containing cycles, in terms of its girth’ has been presented. Recall that the girth of G (denoted by g(G)) is the length of the smallest cycle in G. Assume throughout this article that G is a non-trivial graph of order n ≥ 3 and contains a cycle.
Keywords:
:Roman domination, Strong Roman domination, Bounds.Full Text:
PDFReferences
[1] K. Selvakumar and M. Kamaraj and, Strong Roman domina-tion in graphs, (Submitted).
[2] E. J. Cockayne, P. A. Dreyer, S. M. Hedetniemi and S. T. Hedetniemi, Roman domination in graphs, Discrete Math., 278 (2004), 11{22.
[3] P. A. Dreyer, Applications and variations of domination in graphs, Ph.D. Thesis, New Brunswick, New Jersey, 2000.
[4] O. Favaron, H. Karamic, R. Khoeilar and S. M. Sheikholeslami, On the Roman domination number of a graph, Discrete Math., 309 (2009), 3447{ 3451.
[5] M. A. Henning, Defending the Roman empire from multiple attacks, Discrete Math., 271 (2003), 101{115.
[6] T. Kraner Sumenjak, P. Parlic and A. Tepeh, On the Roman domination in the lexicographic product of graphs, Discrete Appl. Math., 160 (2012), 2030{2036.
[7] P. Parlic and J. Zerovnik, Roman domination number of the Cartesian prod-ucts of paths and cycles, Electron. J. Combin., 19(3) (2012), #P19.
[8] I. Strewart, Defend the Roman empire, Sci. Amer., 28(6) (1999), 136{139.
[9] F. Xueliang, Y. Yuausheng and J. Bao, Roman domination in regular graphs, Discrete Math., 309(6) (2009), 1528{1537.
Refbacks
- There are currently no refbacks.