ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2019: 0.600
Rejection Rate (2018-2019): c. 84%
Article in press
D.J. Klein, J.A. Rodríguez-Velázquez
Protection of lexicographic product graphs
Discussiones Mathematicae Graph Theory
In this paper, we study the weak Roman domination number and the secure
domination number of lexicographic product graphs. In particular, we show that
these two parameters coincide for almost all lexicographic product graphs.
Furthermore, we obtain tight bounds and closed formulas for these parameters.
lexicographic product, weak Roman domination, secure domination,
total domination, double total domination