Open Access
Issue |
RAIRO-Oper. Res.
Volume 57, Number 3, May-June 2023
|
|
---|---|---|
Page(s) | 1209 - 1217 | |
DOI | https://doi.org/10.1051/ro/2023072 | |
Published online | 14 June 2023 |
- N. Alon and J. Spencer, The Probabilistic Method. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, Chichester (2000). [Google Scholar]
- E.W. Chambers, W.B. Kinnersley, N. Prince and D.B. West, Extremal problems for roman domination. SIAM J. Discret. Math. 23 (2009) 1575–1586. [CrossRef] [Google Scholar]
- M. Chellali, N. Jafari Rad, S.M. Sheikholeslami and L. Volkmann, Roman domination in graphs, in Topics in Domination in Graphs. Developments in Mathematics, edited by T.W. Haynes, S.T. Hedetniemi and M.A. Henning. Vol. 64. Springer, Cham (2020). [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 (2020). [Google Scholar]
- M. Chellali, N. Jafari Rad, S.M. Sheikholeslami and L. Volkmann, Varieties of Roman domination II. AKCE J Graphs Comb. 17 (2020) 966–984. [CrossRef] [MathSciNet] [Google Scholar]
- H. Chernoff, A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23 (1952) 493–509. [CrossRef] [Google Scholar]
- E.J. Cockayane, P.M. Dreyer Jr, S.M. Hedetniemi and S.T. Hedetniemi, On Roman domination in graphs. Discrete Math. 278 (2004) 11–22. [CrossRef] [MathSciNet] [Google Scholar]
- O. Favaron, κ-domination and κ-independence in graphs. ARS Comb. 25C (1988) 159–167. [Google Scholar]
- O. Favaron, G. Fricke, W. Goddard, S.M. Hedetniemi, S.T. Hedetniemi, P. Kristiansen, R.C. Laskar and D.R. Skaggs, Offensive alliances in graphs. Discuss. Math. Graph Theory 24 (2004) 263–275. [Google Scholar]
- A. Harutyunyan, Global offensive alliances in graphs and random graphs. Discrete Appl. Math. 164 (2014) 522–526. [CrossRef] [MathSciNet] [Google Scholar]
- A. Harutyunyan, Some bounds on alliances in trees, in 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010) 83–86. [Google Scholar]
- T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998). [Google Scholar]
- T.W. Haynes, S.T. Hedetniemi and M.A. Henning, Global defensive alliances in graphs. Electron. J. Comb. 10 (2003) R47. [CrossRef] [Google Scholar]
- S.M. Hedetniemi, S.T. Hedetniemi and P. Kristiansen, Alliances in graphs. J. Comb. Math. Comb. Comput. 48 (2004) 157–177. [Google Scholar]
- N. Jafari Rad, Upper bounds on the global offensive alliances in graphs. Discrete Appl. Math. 289 (2021) 148–152. [CrossRef] [MathSciNet] [Google Scholar]
- K. Kammerling and L. Volkmann, Roman κ-domination in graphs. J. Korean Math. Soc. 46 (2009) 1309–1318. [CrossRef] [MathSciNet] [Google Scholar]
- D.A. Mojdeh and S.M.H. Moghaddam, A correction to a paper on Roman κ-domination in graphs. Bull. Korean Math. Soc. 50 (2013) 469–473. [CrossRef] [MathSciNet] [Google Scholar]
- J.A. Rodrguez-Velázquez and J.M. Sigarreta, Global offensive alliances in graphs. Electron. Notes Discrete Math. 25 (2006) 157–164. [CrossRef] [Google Scholar]
- J.A. Rodrguez-Velázquez and J.M. Sigarreta, On defensive alliances and line graphs. Appl. Math. Lett. 19 (2006) 1345–1350. [CrossRef] [MathSciNet] [Google Scholar]
- J.M. Sigarreta and J.A. Rodrguez-Velázquez, On the global offensive alliance number of a graph. Discrete Appl. Math. 157 (2009) 219–226. [CrossRef] [MathSciNet] [Google Scholar]
- J.M. Sigarreta, I.G. Yero, S. Bermudo and J.A. Rodrguez-Velázquez, Partitioning a graph into offensive κ-alliances. Discrete Appl. Math. 159 (2011) 224–231. [CrossRef] [MathSciNet] [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.