Defending the Roman Empire---a new strategy
From MaRDI portal
Publication:1810648
DOI10.1016/S0012-365X(02)00811-7zbMath1024.05068OpenAlexW2087928776MaRDI QIDQ1810648
Stephen T. Hedetniemi, Michael A. Henning
Publication date: 9 June 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00811-7
Related Items (79)
Roman \(\{2 \}\)-domination ⋮ Strong equality of Roman and weak Roman domination in trees ⋮ Algorithmic aspects of total Roman and total double Roman domination in graphs ⋮ Improved integer linear programming formulation for weak Roman domination problem ⋮ Unnamed Item ⋮ Some progress on the double Roman domination in graphs ⋮ Outer independent Roman dominating functions in graphs ⋮ Weak Roman domination in rooted product graphs ⋮ The \(\mathbb{N}_k\)-valued Roman domination and its boundaries ⋮ Weak Roman subdivision number of graphs ⋮ On trees with equal Roman domination and outer-independent Roman domination numbers ⋮ Upper secure domination number of a graph ⋮ Total protection of lexicographic product graphs ⋮ Double Roman domination ⋮ Extremal problems on weak Roman domination number ⋮ Protection of graphs with emphasis on Cartesian product graphs ⋮ On the strong Roman domination number of graphs ⋮ Triple Roman domination in graphs ⋮ On the double Roman domination in graphs ⋮ Roman domination on strongly chordal graphs ⋮ Exact algorithms for weak Roman domination ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ Secure vertex cover of a graph ⋮ Independent protection in graphs ⋮ On unique minimum dominating sets in some Cartesian product graphs ⋮ Algorithmic aspects of outer independent Roman domination in graphs ⋮ Graphs whose weak Roman domination number increases by the deletion of any edge ⋮ On the weak Roman domination number of lexicographic product graphs ⋮ The Outer-Paired Domination of Graphs ⋮ Independent Roman \(\{2 \}\)-domination in graphs ⋮ Tight bounds for eternal dominating sets in graphs ⋮ On the \(k\)-strong Roman domination problem ⋮ Roman {2}-domination in Graphs and Graph Products ⋮ Defending the Roman Empire from multiple attacks ⋮ Global Roman domination in graphs ⋮ Graphs with small Italian domatic number ⋮ Signed Roman domination in graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the co-Roman domination in graphs ⋮ On the total Roman domination in trees ⋮ Combinatorics for smaller kernels: the differential of a graph ⋮ An upper bound on the double Roman domination number ⋮ Roman dominating influence parameters ⋮ From (secure) \(w\)-domination in graphs to protection of lexicographic product graphs ⋮ ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS ⋮ Double Roman domination number ⋮ Regular graphs with large Italian domatic number ⋮ Algorithmic Aspects of Quasi-Total Roman Domination in Graphs ⋮ Unnamed Item ⋮ ON THE ROMAN BONDAGE NUMBER OF A GRAPH ⋮ Unnamed Item ⋮ R<scp>OMAN DOMINATION</scp>: a parameterized perspective† ⋮ Secure Italian domination in graphs ⋮ Italian domination of Cartesian products of directed cycles ⋮ Efficient algorithms for Roman domination on some classes of graphs ⋮ Algorithmic results on double Roman domination in 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 ⋮ Bounds on weak Roman and 2-rainbow domination numbers ⋮ Varieties of Roman Domination ⋮ Eternal and Secure Domination in Graphs ⋮ Algorithmic aspects of Roman domination in graphs ⋮ Protection of lexicographic product graphs ⋮ Unnamed Item ⋮ Bounds on the co-Roman domination number in graphs ⋮ Roman domination in unicyclic graphs ⋮ Weakly connected Roman domination in graphs ⋮ Constructive characterizations concerning weak Roman domination in trees ⋮ Trees with equal Roman {2}-domination number and independent Roman {2}-domination number ⋮ A Nordhaus–Gaddum bound for Roman domination ⋮ Eternally dominating large grids ⋮ Secure domination critical graphs ⋮ An algorithm to recognize weak roman domination stable trees under vertex deletion ⋮ Co-Roman domination in graphs ⋮ INVERSE ROMAN DOMINATION IN GRAPHS ⋮ Algorithmic complexity of weakly connected Roman domination in graphs ⋮ Isolate Roman domination in graphs ⋮ SIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS
Cites Work
This page was built for publication: Defending the Roman Empire---a new strategy
