On the strong Roman domination number of graphs
Authors:
- M.P. Álvarez-RuizMÁM.P. Álvarez-Ruiz
- T. Mediavilla-GradolphTMT. Mediavilla-Gradolph
- S.M. SheikholeslamiSSS.M. Sheikholeslami
- J.C. Valenzuela-TripodoroJVJ.C. Valenzuela-Tripodoro
- I.G. YeroI.G. Yero
- 1 November 2017
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 231, 44-59
Abstract
No abstract availableAll Related Versions
This publication has 20 references indexed in Scilit:
- On the Roman domination number of a graphDiscrete Mathematics, 2009
- Upper bounds on the k-domination number and the k-Roman domination numberDiscrete Applied Mathematics, 2009
- Roman domination in regular graphsDiscrete Mathematics, 2009
- Extremal Problems for Roman DominationSIAM Journal on Discrete Mathematics, 2009
- Roman domination in graphsDiscrete Mathematics, 2004
- Defending the Roman Empire from multiple attacksDiscrete Mathematics, 2003
- Defending the Roman Empire—A new strategyDiscrete Mathematics, 2003
- A characterization of Roman treesDiscussiones Mathematicae Graph Theory, 2002
- Defend the Roman Empire!Scientific American, 1999
- A new graph product and its spectrumBulletin of the Australian Mathematical Society, 1978