Open Access
Issue |
RAIRO-Oper. Res.
Volume 56, Number 4, July-August 2022
|
|
---|---|---|
Page(s) | 2293 - 2304 | |
DOI | https://doi.org/10.1051/ro/2022089 | |
Published online | 29 July 2022 |
- V. Anu and A. Lakshmanan, Double Roman domination number. Discret. Appl. Math. 244 (2018) 198–204. [CrossRef] [MathSciNet] [Google Scholar]
- J. Arquilla and H. Fredricksen, “Graphing” – An Optimal Grand Strategy. Mil. Oper. Res. 1 (1995) 3–17. [CrossRef] [Google Scholar]
- R.A. Beeler, T.W. Haynes and S.T. Hedetniemi, Double Roman domination. Discret. Appl. Math. 211 (2016) 23–29. [CrossRef] [Google Scholar]
- M. Chellali, T.W. Haynes, S.T. Hedetniemi and A.A. McRaee, Roman {2}-domination. Discret. Appl. Math. 204 (2016) 22–28. [CrossRef] [Google Scholar]
- X. Chen, J. Liu and J. Meng, Total restrained domination in graphs. Comput. Math. Appl. 62 (2011) 2892–2898. [CrossRef] [MathSciNet] [Google Scholar]
- G.S. Domke, J.H. Hattingh, S.T. Hedetniemi, R.C. Laskar and L.R. Markus, Restrained domination in graphs. Discret. Math. 203 (1999) 61–69. [CrossRef] [Google Scholar]
- J. Hattingh and E. Joubert, Restrained domination in cubic graphs. J. Comb. Optim. 22 (2011) 166–179. [CrossRef] [MathSciNet] [Google Scholar]
- T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in graphs. New York: Marcel Dekker (1998). [Google Scholar]
- M. Henning, Graphs with large restrained domination number. Discret. Math. 197198 (1999) 415–429. [CrossRef] [Google Scholar]
- M.A. Henning, Defending the Roman Empire from multiple attacks. Discret. Math. 271 (2003) 101–115. [CrossRef] [Google Scholar]
- N. Jafari Rad and H. Rahbani, Some progress on the double Roman domination in graphs. Discuss. Math. Graph Theory 39 (2018) 41–53. [Google Scholar]
- R. Karp, Reducibility among combinatorial problems, in: Complexity of Computer Computations (Proc. Sympos., IBM Thomas J. Watson Research Center, Yorktown Heights, New York, 1972) (1972) 85–103. [Google Scholar]
- D.A. Mojdeh and L. Volkmann, Roman {3}-domination (double Italian domination). Discret. Appl. Math. 283 (2020) 555–564. [CrossRef] [Google Scholar]
- C.S. ReVelle and K.E. Rosing, Defendens Imperium Romanum: A classical problem in military strategy. Am. Math. Mon. 107 (2000) 585–594. [CrossRef] [Google Scholar]
- P. Roushini Leely and C. Suseendran, Secure restrained domination in Graphs. Math. Comput. Sci. 9 (2015) 239–247. [CrossRef] [MathSciNet] [Google Scholar]
- P. Roushini Leely and S. Padmapriea, Restrained Roman domination in graphs. Trans. Comb. 4 (2015) 1–17. [MathSciNet] [Google Scholar]
- B. Samadi, M. Alishahi, I. Masoumi and D.A. Mojdeh, Restrained Italian domination in graphs. RAIRO: OR 55 (2021) 319–332. [CrossRef] [EDP Sciences] [Google Scholar]
- I. Stewart, Defend the Roman Empire. Sci. Am. 281 (1999) 136–138. [CrossRef] [Google Scholar]
- Z. Tahmasbzadehbaee, D.S. Nandappa, H.A. Ahangar, D.A. Mojdeh and Y. Zhao, Total restrained domination in graphs of diameter 2 or 3. Math. Sci. 7 (2013) 26. [CrossRef] [Google Scholar]
- D.B. West, in Introduction to Graph Theory, 2nd edition. Prentice Hall (2001). [Google Scholar]
- X. Zhang, Z. Li, H. Jiang and Z. Shao, Double Roman domination in trees. Inf. Process. Lett. 134 (2018) 31–34. [CrossRef] [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.