### Signed strong Roman domination in graphs

#### Abstract

#### Keywords

#### Full Text:

PDF#### References

H. Abdollahzadeh Ahangar, M. A. Henning, Y. Zhao, C. Lowenstein and V. Samodivkin, Signed Roman domination in graphs, J. Comb. Optim.,27(2014), 241--255.

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--316.

E. W. Chambers, B. Kinnersley, N. Prince and D. B. West, Extremal problems for Roman domination, SIAM J. Discrete Math.23(2009), 1575--1586.

E. J. Cockayne, P. A. Dreyer Jr., S. M. Hedetniemi and S. T. Hedetniemi, Roman domination in graphs, Discrete Math., 278(2004),11--22.

P. Erdos, L. Posa, On the maximal number of disjoint circuits in a graph, Publ. Math. Debrecen, 9(1962), 3--12.

O. Favaron, H. Karami, R. Khoeilar and S. M. Sheikholeslami, On the Roman domination number of a graph, Discrete Math., 309(2009), 3447--3451.

S. M. Sheikholeslami and L. Volkmann, Signed Roman domination

number in digraphs, J. Comb. Optim., 30(2015), 456--467.

S. M. Sheikholeslami and L. Volkmann, The Roman $k$-domatic number of a graph}, Acta Math. Sinica, 27(2011), 1899--1906.

DOI: http://dx.doi.org/10.5556/j.tkjm.48.2017.2240

Sponsored by Tamkang University | ISSN 0049-2930 (Print), ISSN 2073-9826 (Online) |