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)- Independent double Roman domination in graphs
- Roman dominating influence parameters
- Global total Roman domination in graphs
- A note on the Roman domatic number of a digraph
- The vertex-edge locating Roman domination of some graphs
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- On the double Roman domination of graphs
- The Roman domatic problem in graphs and digraphs: a survey
- Algorithmic aspects of total Roman and total double Roman domination in graphs
- On the double Roman domination in graphs
- Total Roman domination in the lexicographic product of graphs
- Total Roman domination for proper interval graphs
- A note on the eternal dominating set problem
- The Roman domination number of comaximal ideal graph
- Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties
- Global Roman domination in trees
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Unique response strong Roman dominating functions of graphs
- A characterization of double Roman trees
- Defending the Roman Empire from multiple attacks
- On the (total) restrained double Italian domination of central of graphs
- On perfect Italian domination in graphs
- (Eternal) vertex cover numbers of infinite and finite grid graphs
- On the double Roman domination number in trees
- Computing Roman domatic number of graphs
- On algorithmic complexity of double Roman domination
- The roman k-domatic number of a graph
- Roman domination on strongly chordal graphs
- Algorithmic results on double Roman domination in graphs
- On the total restrained double Italian domination
- Quadruple Roman domination in graphs
- Convex Italian domination in graphs
- A note on the double Roman domination number of graphs.
- On the global Roman domination number in graphs
- Signed double Roman domination in graphs
- On computing secure domination of trees
- Improved integer linear programming formulation for weak Roman domination problem
- Integer linear programming formulations for double Roman domination problem
- On roman, global and restrained domination in graphs
- Minimal Roman dominating functions: extensions and enumeration
- Roman domination in graphs.
- A note on Roman domination in graphs
- Algorithmic aspects of Roman domination in graphs
- On maximal Roman domination in graphs: complexity and algorithms
- Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination
- On the double Roman bondage numbers of graphs
- Efficient algorithms for Roman domination on some classes of graphs
- On the Roman domination number of a graph
- Roman domination in regular graphs
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
- The roman domatic number of a graph
- Defending the Roman Empire---a new strategy
- Relating the outer-independent total Roman domination number with some classical parameters of graphs
- Independent Roman domination and 2-independence in trees
- Trees with independent Roman domination number twice the independent domination number
- An upper bound on triple Roman domination
- On hop Roman domination in trees
- Algorithmic and complexity aspects of problems related to total Roman domination for graphs
- Eternal and Secure Domination in Graphs
- On the complexity of some hop domination parameters
- A Roman domination chain
- Double Roman domination and domatic numbers of graphs
- Tight bounds for eternal dominating sets in graphs
- On the algorithmic complexity of Roman \(\{2\}\)-domination (Italian domination)
- A Nordhaus-Gaddum bound for Roman domination
- Perfect Italian domination on some generalizations of cographs
- Further progress on the total Roman \(\{2\}\)-domination number of graphs
- Total Roman \(\{2\}\)-dominating functions in graphs
- Roman domination dot-critical graphs
- Triple Roman domination in graphs
- Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number
- A new upper bound for the perfect Italian domination number of a tree
- Independent double Roman domination number of a tree in terms of its 2-independence number
- Variations of Roman domination in Kneser graphs
- The Roman \(\{2 \}\)-domatic number of graphs
- The perfect locating signed Roman domination of some graphs
- Graphs with large Italian domination number
- Independent Roman \(\{3\}\)-domination
- Total Roman reinforcement in graphs
- Bounds on the double Italian domination number of a graph
- Perfect Italian domination in graphs: complexity and algorithms
- On bondage numbers of graphs: a survey with some comments
- Roman \(\{ 3 \}\)-domination (double Italian domination)
- Maximal 2-rainbow domination number of a graph
- Double Roman domination
- Perfect Italian domination on planar and regular graphs
- Quasi-total Roman domination in graphs
- Algorithmic complexity of weakly connected Roman domination in graphs
- Algorithmic aspects of Roman graphs
- Note on the perfect Roman domination number of graphs
- Total Roman domination subdivision number in graphs
- Binary programming formulations for the upper domination problem
- A method for eternally dominating strong grids
- Edge lifting and Roman domination in graphs
- On the Roman domination subdivision number of a graph
- Outer independent Roman dominating functions in graphs
- Roman domination and 2-independence in trees
- Total Roman domination on Kneser graphs
- Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between
- The Roman domination number of some special classes of graphs - convex polytopes
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)
