Defending the Roman Empire from multiple attacks
From MaRDI portal
Publication:1408869
DOI10.1016/S0012-365X(03)00040-2zbMath1022.05055MaRDI QIDQ1408869
Publication date: 25 September 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (28)
A note on the Roman domatic number of a digraph ⋮ Algorithmic aspects of total Roman and total double Roman domination in graphs ⋮ Improved integer linear programming formulation for weak Roman domination problem ⋮ Resolving Roman domination in graphs ⋮ Trees with unique Roman dominating functions of minimum weight ⋮ On the strong Roman domination number of graphs ⋮ Roman domination on strongly chordal graphs ⋮ On unique minimum dominating sets in some Cartesian product graphs ⋮ Unnamed Item ⋮ Complexity aspects of restrained Roman domination in graphs ⋮ On the \(k\)-strong Roman domination problem ⋮ Global Roman domination in graphs ⋮ On the global Roman domination number in graphs ⋮ Signed Roman domination in graphs ⋮ Unnamed Item ⋮ Roman dominating influence parameters ⋮ Algorithmic Aspects of Quasi-Total Roman Domination in Graphs ⋮ ON THE ROMAN BONDAGE NUMBER OF A GRAPH ⋮ R<scp>OMAN DOMINATION</scp>: a parameterized perspective† ⋮ Efficient algorithms for Roman domination on some classes of graphs ⋮ Approximation algorithm for a generalized Roman domination problem in unit ball graphs ⋮ Effect of vertex deletion on the weak Roman domination number of a graph ⋮ Algorithmic aspects of Roman domination in graphs ⋮ Unnamed Item ⋮ Roman domination in unicyclic graphs ⋮ Secure domination critical graphs ⋮ Algorithmic complexity of weakly connected Roman domination in graphs ⋮ On the roman domination number of generalized Sierpiński graphs
Cites Work
This page was built for publication: Defending the Roman Empire from multiple attacks
