Defending the Roman Empire from multiple attacks

From MaRDI portal
Revision as of 17:34, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1408869

DOI10.1016/S0012-365X(03)00040-2zbMath1022.05055MaRDI QIDQ1408869

Michael A. Henning

Publication date: 25 September 2003

Published in: Discrete Mathematics (Search for Journal in Brave)




Related Items

A note on the Roman domatic number of a digraphAlgorithmic aspects of total Roman and total double Roman domination in graphsImproved integer linear programming formulation for weak Roman domination problemResolving Roman domination in graphsTrees with unique Roman dominating functions of minimum weightOn the strong Roman domination number of graphsRoman domination on strongly chordal graphsOn unique minimum dominating sets in some Cartesian product graphsUnnamed ItemComplexity aspects of restrained Roman domination in graphsOn the \(k\)-strong Roman domination problemGlobal Roman domination in graphsOn the global Roman domination number in graphsSigned Roman domination in graphsUnnamed ItemRoman dominating influence parametersAlgorithmic Aspects of Quasi-Total Roman Domination in GraphsON THE ROMAN BONDAGE NUMBER OF A GRAPHR<scp>OMAN DOMINATION</scp>: a parameterized perspective†Efficient algorithms for Roman domination on some classes of graphsApproximation algorithm for a generalized Roman domination problem in unit ball graphsEffect of vertex deletion on the weak Roman domination number of a graphAlgorithmic aspects of Roman domination in graphsUnnamed ItemRoman domination in unicyclic graphsSecure domination critical graphsAlgorithmic complexity of weakly connected Roman domination in graphsOn the roman domination number of generalized Sierpiński graphs



Cites Work