Signed Roman domination in graphs

H. Abdollahzadeh Ahangar, Michael A. Henning (), Christian Löwenstein, Yancai Zhao and Vladimir Samodivkin
Additional contact information
H. Abdollahzadeh Ahangar: Babol University of Technology
Michael A. Henning: University of Johannesburg
Christian Löwenstein: University of Johannesburg
Yancai Zhao: Wuxi City College of Vocational Technology
Vladimir Samodivkin: University of Architecture Civil Engineering and Geodesy

Journal of Combinatorial Optimization, 2014, vol. 27, issue 2, No 3, 255 pages

Abstract: Abstract In this paper we continue the study of Roman dominating functions in graphs. A signed Roman dominating function (SRDF) on a graph G=(V,E) is a function f:V→{−1,1,2} satisfying the conditions that (i) the sum of its function values over any closed neighborhood is at least one and (ii) for every vertex u for which f(u)=−1 is adjacent to at least one vertex v for which f(v)=2. The weight of a SRDF is the sum of its function values over all vertices. The signed Roman domination number of G is the minimum weight of a SRDF in G. We present various lower and upper bounds on the signed Roman domination number of a graph. Let G be a graph of order n and size m with no isolated vertex. We show that $\gamma _{\mathrm{sR}}(G) \ge\frac{3}{\sqrt{2}} \sqrt{n} - n$ and that γ sR(G)≥(3n−4m)/2. In both cases, we characterize the graphs achieving equality in these bounds. If G is a bipartite graph of order n, then we show that $\gamma_{\mathrm{sR}}(G) \ge3\sqrt{n+1} - n - 3$ , and we characterize the extremal graphs.

Keywords: Roman domination; Signed domination; Signed Roman domination (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9500-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:27:y:2014:i:2:d:10.1007_s10878-012-9500-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-012-9500-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().