Abstract
The closed neighborhood \(N_G[e]\) of an edge \(e\) in a graph \(G\) is the set consisting of \(e\) and of all edges having a common end-vertex with \(e\). Let \(f\) be a function on \(E(G)\), the edge set of \(G\), into the set \(\{-1, 1, 2\}\). If \( \sum _{x\in N[e]}f(x) \ge 1\) for every edge \(e\) of \(G\) and every edge \(e\) for which \(f (e) = -1\) is adjacent to at least one edge \(e'\) for which \(f (e')= 2\), then \(f\) is called a signed Roman edge dominating function of \(G\). The minimum of the values \(\sum _{e\in E(G)} f(e)\), taken over all signed Roman edge dominating functions \(f\) of \(G\), is called the signed Roman edge domination number of \(G\) and is denoted by \(\gamma _{sR}'(G)\). In this note we initiate the study of the signed Roman edge domination in graphs and present some (sharp) bounds for this parameter.
Similar content being viewed by others
References
Ahangar HA, Henning MA, Zhao Y, Löwenstein C, Samodivkin V (2014) Signed Roman domination in graphs. J Comb Optim 27:241–255
Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Marcel Dekker, New York
Haynes TW, Hedetniemi ST, Slater PJ (1998) Domination in graphs: advanced topics. Marcel Dekker, New York
Karami H, Khodkar A, Sheikholeslami SM (2008) Some notes on signed edge domination in graphs. Graphs Comb 24:27–32
Karami H, Khodkar A, Sheikholeslami SM (2009) An improved upper bound for signed edge domination numbers in graphs. Util Math 78:121–128
Karami H, Khodkar A, Sheikholeslami SM (2009) Signed edge domination numbers in trees. ARS Comb 93:451–457
Sheikholeslami SM, Volkmann L (2012) The signed Roman domatic number of a graph. Ann Math Inform 40:105–112
Sheikholeslami SM, Volkmann L (2014) Signed Roman domination number in digraphs. J Comb Optim. doi:10.1007/s10878-013-9648-2
West DB (2001) Introduction to graph theory, 2nd edn. Prentice Hall, Upper Saddle River
Xu B (2001) On signed domination numbers of graphs. Discret Math 239:179–189
Xu B (2006) Two classes of edge domination in graphs. Discret Appl Math 154:1541–1546
Zelinka B (2002) On signed edge domination numbers of trees. Math Bohem 127:49–55
Acknowledgments
The authors would like to thank anonymous referees for their helpful suggestions and comments. S. M. Sheikholeslami Research supported by the Research Office of Azarbaijan Shahid Madani University.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ahangar, H.A., Amjadi, J., Sheikholeslami, S.M. et al. Signed Roman edge domination numbers in graphs. J Comb Optim 31, 333–346 (2016). https://doi.org/10.1007/s10878-014-9747-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-014-9747-8
Keywords
- Signed Roman dominating function
- Signed Roman domination number
- Signed Roman edge dominating function
- Signed Roman edge domination number