Defending the Roman Empire---a new strategy
From MaRDI portal
Publication:1810648
DOI10.1016/S0012-365X(02)00811-7zbMath1024.05068MaRDI QIDQ1810648
Stephen T. Hedetniemi, Michael A. Henning
Publication date: 9 June 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
ON THE ROMAN BONDAGE NUMBER OF A GRAPH, Unnamed Item, Unnamed Item, Trees with equal Roman {2}-domination number and independent Roman {2}-domination number, A Nordhaus–Gaddum bound for Roman domination, On trees with equal Roman domination and outer-independent Roman domination numbers, Secure vertex cover of a graph, R<scp>OMAN DOMINATION</scp>: a parameterized perspective†, An upper bound on the double Roman domination number, An algorithm to recognize weak roman domination stable trees under vertex deletion, Roman \(\{2 \}\)-domination, Strong equality of Roman and weak Roman domination in trees, The \(\mathbb{N}_k\)-valued Roman domination and its boundaries, Upper secure domination number of a graph, Double Roman domination, Roman domination on strongly chordal graphs, Independent protection in graphs, Combinatorics for smaller kernels: the differential of a graph, Bounds on weak Roman and 2-rainbow domination numbers, Constructive characterizations concerning weak Roman domination in trees, On unique minimum dominating sets in some Cartesian product graphs, Global Roman domination in graphs, Efficient algorithms for Roman domination on some classes of graphs, Secure domination critical graphs, Defending the Roman Empire from multiple attacks, Improved integer linear programming formulation for weak Roman domination problem, Some progress on the double Roman domination in graphs, Extremal problems on weak Roman domination number, Domination parameters with number 2: interrelations and algorithmic consequences, Independent Roman \(\{2 \}\)-domination in graphs, On the co-Roman domination in graphs, On the total Roman domination in trees, Double Roman domination number, On the \(k\)-strong Roman domination problem, 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, Weakly connected Roman domination in graphs, Eternally dominating large grids, Co-Roman domination in graphs, On the strong Roman domination number of graphs, On the double Roman domination in graphs, Exact algorithms for weak Roman domination, On the weak Roman domination number of lexicographic product graphs, Tight bounds for eternal dominating sets in graphs, Signed Roman domination in graphs, Roman dominating influence parameters, Triple Roman domination in graphs, Roman domination in unicyclic graphs, INVERSE ROMAN DOMINATION IN GRAPHS, Outer independent Roman dominating functions in graphs, ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS
Cites Work
