Open Access
Issue |
RAIRO-Oper. Res.
Volume 57, Number 2, March-April 2023
|
|
---|---|---|
Page(s) | 371 - 382 | |
DOI | https://doi.org/10.1051/ro/2023017 | |
Published online | 15 March 2023 |
- M. Adabi, E. Ebrahimi Targhi, N. Jafari Rad and M. Saied Moradi, Properties of independent Roman domination in graphs. Australas. J. Combin. 52 (2012) 11–18. [MathSciNet] [Google Scholar]
- A. Bahremandpour, F.-T. Hu, S.M. Sheikholeslami and J.-M. Xu, On the Roman bondage number of a graph. Discrete Math. Algorithms Appl. 5 (2013) 15. [Google Scholar]
- M. Cary, J. Cary and S. Prabhu, Independent domination in directed graphs. Commun. Comb. Optim. 6 (2021) 67–80. [MathSciNet] [Google Scholar]
- M. Chellali, N. Jafari Rad, S.M. Sheikholeslami and L. Volkmann, Roman domination in graphs, in Topics in Domination in Graphs, Edited by T.W. Haynes, S.T. Hedetniemi and M.A. Henning. Springer, Berlin/Heidelberg (2020) 365–409. [CrossRef] [Google Scholar]
- M. Chellali, N. Jafari Rad, S.M. Sheikholeslami and L. Volkmann, Varieties of Roman domination II. AKCE Int. J Graphs Comb. 17 (2020) 966–984. [CrossRef] [MathSciNet] [Google Scholar]
- M. Chellali, N. Jafari Rad, S.M. Sheikholeslami and L. Volkmann, A survey on Roman domination parameters in directed graphs. J. Combin. Math. Combin. Comput. 151 (2020) 141–171. [Google Scholar]
- M. Chellali, N. Jafari Rad, S.M. Sheikholeslami and L. Volkmann, Varieties of Roman domination, in Structures of Domination in Graphs, Edited by T.W. Haynes, S.T. Hedetniemi and M.A. Henning. Springer, Berlin/Heidelberg (2021) 273–307. [CrossRef] [Google Scholar]
- M. Chellali, N. Jafari Rad, S.M. Sheikholeslami and L. Volkmann, The Roman domatic problem in graphs and digraphs: a survey. Discuss. Math. Graph Theory 42 (2022) 861–891. [Google Scholar]
- E.J. Cockayne, P.A. Dreyer, S.M. Hedetniemi and S.T. Hedetniemi, Roman domination in graphs. Discrete Math. 278 (2004) 11–22. [Google Scholar]
- J.F. Fink, M.S. Jacobson, L.F. Kinch and J. Roberts, The bondage number of a graph. Discrete Math. 86 (1990) 47–57. [CrossRef] [MathSciNet] [Google Scholar]
- M. Fischermann, D. Rautenbach and L. Volkmann, Remarks on the bondage number of planar graphs. Discrete Math. 260 (2003) 57–67. [CrossRef] [MathSciNet] [Google Scholar]
- M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completness. Freeman, San Francisco (1979). [Google Scholar]
- T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs. Marcel Dekker Inc., New York (1998). [Google Scholar]
- J. Hou and G. Liu, A bound on the bondage number of toroidal graphs. Discrete Math. Algorithms Appl. 4 (2012) 1250046. [CrossRef] [Google Scholar]
- N. Jafari Rad and L. Volkmann, Roman bondage in graphs. Discuss. Math. Graph Theory 31 (2011) 763–773. [CrossRef] [MathSciNet] [Google Scholar]
- N. Jafari Rad and L. Volkmann, On the Roman bondage number of planar graphs. Graphs Combin. 27 (2011) 31–538. [Google Scholar]
- N. Jafari Rad, H.R. Maimani, M. Momeni and F. Rahimi Mahid, On the double Roman bondage numbers of graphs. Discrete Math. Algorithms Appl. 14 (2022) 2250046. [CrossRef] [Google Scholar]
- L. Kang and J. Yuan, Bondage number of planar graphs. Discrete Math. 222 (2000) 191–198. [CrossRef] [MathSciNet] [Google Scholar]
- C. Padamutham and P. Venkata Subba Reddy, Complexity aspects of variants of independent Roman domination in graphs. Bull. Iran. Math. Soc. 47 (2021) 1715–1735. [CrossRef] [MathSciNet] [Google Scholar]
- C. Padamutham and P. Venkata Subba Reddy, Independent Roman 3-domination. Trans. Comb. 11 (2022) 99–110. [MathSciNet] [Google Scholar]
- A. Poureidi, Efficient algorithms for independent Roman domination on some classes of graphs. Commun. Comb. Optim. 8 (2023) 127–140. [MathSciNet] [Google Scholar]
- A. Rahmouni and M. Chellali, Independent Roman 2 -domination in graphs. Discrete Appl. Math. 236 (2018) 408–414. [CrossRef] [MathSciNet] [Google Scholar]
- W. Zhao and H. Zhang, The bondage number of the strong product of a complete graph with a path and a special starlike tree. Discrete Math. Algorithms Appl. 8 (2016) 1650006. [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.