Defendens Imperium Romanum: A Classical Problem in Military Strategy
From MaRDI portal
Recommendations
- Defending the Roman Empire from multiple attacks
- Designing a model for service facility protection with a time horizon based on tri-level programming
- Single- and multi-objective defensive location problems on a network
- On the \(k\)-strong Roman domination problem
- A defensive maximal covering problem on a network
Cited in
(only showing first 100 items - show all)- Efficient algorithms for Roman domination on some classes of graphs
- Roman domination in regular graphs
- On the Roman domination number of a graph
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
- Defending the Roman Empire from multiple attacks
- Roman domination in graphs.
- Improved integer linear programming formulation for weak Roman domination problem
- Some progress on the double Roman domination in graphs
- Mixed Roman domination in graphs
- Bounds on the locating Roman domination number in trees
- Perfect Roman domination in trees
- Independent Roman \(\{2 \}\)-domination in graphs
- Nordhaus-Gaddum bounds for total Roman domination
- Some improved inequalities related to Vizing's conjecture
- On the global Roman domination number in graphs
- On the co-Roman domination in graphs
- On the total Roman domination in trees
- Signed double Roman domination in graphs
- The Roman \(\{2 \}\)-domatic number of graphs
- A characterization of double Roman trees
- Perfect Italian domination in trees
- A note on the eternal dominating set problem
- Defending the Roman Empire---a new strategy
- On bondage numbers of graphs: a survey with some comments
- Some progress on the restrained Roman domination
- Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination
- Algorithmic aspects of Roman domination in graphs
- Computing strong Roman domination of trees and unicyclic graphs in linear time
- Relating the outer-independent total Roman domination number with some classical parameters of graphs
- Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number
- The Roman domatic problem in graphs and digraphs: a survey
- Total Roman \(\{2\}\)-dominating functions in graphs
- A new upper bound for the perfect Italian domination number of a tree
- Further progress on the total Roman \(\{2\}\)-domination number of graphs
- Bounds on the double Italian domination number of a graph
- Perfect Italian domination in graphs: complexity and algorithms
- Extremal graphs for a bound on the Roman domination number
- Roman \(\{ 3 \}\)-domination (double Italian domination)
- On the \(k\)-strong Roman domination problem
- A characterization of perfect Roman trees
- On algorithmic complexity of double Roman domination
- Perfect Italian domination on planar and regular graphs
- Graphs with large Italian domination number
- Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\)
- Quasi-total Roman domination in graphs
- Unique response Roman domination in graphs
- Note on the perfect Roman domination number of graphs
- Algorithmic results on double Roman domination in graphs
- Independent double Roman domination in graphs
- Algorithmic and complexity aspects of problems related to total Roman domination for graphs
- Total Roman reinforcement in graphs
- Perfect Roman domination in graphs
- On the double Roman domination of graphs
- Global Roman domination in trees
- Roman domination dot-critical graphs
- On the strong Roman domination number of graphs
- On the double Roman domination in graphs
- Exact algorithms for weak Roman domination
- Total Roman domination in the lexicographic product of graphs
- Tight bounds for eternal dominating sets in graphs
- Signed Roman domination in graphs
- Roman dominating influence parameters
- Triple Roman domination in graphs
- Perfect Italian domination in cographs
- Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between
- Trees with independent Roman domination number twice the independent domination number
- Roman domination in graphs: the class \(\mathcal{R}_{UVR}\)
- Roman domination in unicyclic graphs
- Computing Roman domatic number of graphs
- Inverse roman domination in graphs
- Relations between the Roman k-domination and Roman domination numbers in graphs
- Outer independent Roman dominating functions in graphs
- A note on the double Roman domination number of graphs.
- On the double Roman domination number in trees
- Maximal 2-rainbow domination number of a graph
- Double Roman domination
- Roman domination in graphs
- Eternal and Secure Domination in Graphs
- The Roman domination number of some special classes of graphs - convex polytopes
- The roman k-domatic number of a graph
- Roman domination on strongly chordal graphs
- Independent Roman domination and 2-independence in trees
- Mixed Roman domination and 2-independence in trees
- A note on Roman domination: changing and unchanging
- Double Roman domination and domatic numbers of graphs
- Upper bounds for the domination subdivision and bondage numbers of graphs on topological surfaces.
- On the Roman bondage number of a graph
- Critical graphs with Roman domination number four
- Independent double Roman domination in graphs
- Algorithmic aspects of Roman graphs
- Total Roman domination subdivision number in graphs
- Bounds on signed total double Roman domination
- Total Roman domination for proper interval graphs
- Trees with equal strong Roman domination number and Roman domination number
- Bounds on the co-Roman domination number in graphs
- On the complexity of some hop domination parameters
- On computing secure domination of trees
- Algorithmic aspects of total Roman \(\{3\}\)-domination in graphs
- Edge lifting and Roman domination in graphs
- Integer linear programming formulations for double Roman domination problem
This page was built for publication: Defendens Imperium Romanum: A Classical Problem in Military Strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757494)
