Geodesic
Signed Roman Edge k -Domination in Graphs
Discussiones Mathematicae. Graph Theory, Tome 37 (2017) no. 1, pp. 39-53.

Voir la notice de l'article provenant de la source Library of Science

Let k ≥ 1 be an integer, and G = (V, E) be a finite and simple graph. The closed neighborhood N_G [e] of an edge e in a graph G is the set consisting of e and all edges having a common end-vertex with e. A signed Roman edge k-dominating function (SREkDF) on a graph G is a function f : E →−1, 1, 2 satisfying the conditions that (i) for every edge e of G, Σ_ x ∈ N_G [e] f(x) ≥ k and (ii) every edge e for which f(e) = −1 is adjacent to at least one edge e^′ for which f(e^′) = 2. The minimum of the values Σ_e ∈ E f(e), taken over all signed Roman edge k-dominating functions f of G is called the signed Roman edge k-domination number of G, and is denoted by γ_sRk^' (G). In this paper we initiate the study of the signed Roman edge k-domination in graphs and present some (sharp) bounds for this parameter.
Keywords: signed Roman edge k -dominating function, signed Roman edge k -domination number 
@article{DMGT_2017_37_1_a3,
     author = {Asgharsharghi, Leila and Sheikholeslami, Seyed Mahmoud and Volkmann, Lutz},
     title = {Signed {Roman} {Edge} k {-Domination} in {Graphs}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {39--53},
     publisher = {mathdoc},
     volume = {37},
     number = {1},
     year = {2017},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2017_37_1_a3/}
}
TY  - JOUR
AU  - Asgharsharghi, Leila
AU  - Sheikholeslami, Seyed Mahmoud
AU  - Volkmann, Lutz
TI  - Signed Roman Edge k -Domination in Graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2017
SP  - 39
EP  - 53
VL  - 37
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2017_37_1_a3/
LA  - en
ID  - DMGT_2017_37_1_a3
ER  - 
%0 Journal Article
%A Asgharsharghi, Leila
%A Sheikholeslami, Seyed Mahmoud
%A Volkmann, Lutz
%T Signed Roman Edge k -Domination in Graphs
%J Discussiones Mathematicae. Graph Theory
%D 2017
%P 39-53
%V 37
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2017_37_1_a3/
%G en
%F DMGT_2017_37_1_a3
Asgharsharghi, Leila; Sheikholeslami, Seyed Mahmoud; Volkmann, Lutz. Signed Roman Edge k -Domination in Graphs. Discussiones Mathematicae. Graph Theory, Tome 37 (2017) no. 1, pp. 39-53. http://geodesic.mathdoc.fr/item/DMGT_2017_37_1_a3/

[1] H. Abdollahzadeh Ahangar, M.A. Henning, Y. Zhao, C. Löwenstein and V. Samodivkin, Signed Roman domination in graphs, J. Comb. Optim. 27 (2014) 241–255. doi:10.1007/s10878-012-9500-0

[2] H. Abdollahzadeh Ahangar, J. Amjadi, S.M. Sheikholeslami, L. Volkmann and Y. Zhao, Signed Roman edge domination numbers in graphs, J. Comb. Optim. 31 (2016) 333–346. doi:10.1007/s10878-014-9747-8

[3] A.J. Carney and A. Khodkar, Signed edge k-domination numbers in graphs, Bull. Inst. Combin. Appl. 62 (2011) 66–78.

[4] E.W. Chambers, B. Kinnersley, N. Prince and D.B. West, Extremal problems for Roman domination, SIAM J. Discrete Math. 23 (2009) 1575–1586. doi:10.1137/070699688

[5] M.A. Henning and L. Volkmann, Signed Roman k-domination in graphs, Graphs Combin. 32 (2016) 175–190. doi:10.1007/s00373-015-1536-3

[6] M.A. Henning and L. Volkmann, Signed Roman k-domination in trees, Discrete Appl. Math. 186 (2015) 98–105. doi:10.1016/j.dam.2015.01.019

[7] H. Karami, S.M. Sheikholeslami and A. Khodkar, Some notes on signed edge domination in graphs, Graphs Combin. 24 (2008) 29–35. doi:10.1007/s00373-007-0762-8