Defendens Imperium Romanum: A Classical Problem in Military Strategy
From MaRDI portal
Publication:2757494
DOI10.2307/2589113zbMath1039.90038OpenAlexW4251005761MaRDI QIDQ2757494
Kenneth E. Rosing, Charles S. Re Velle
Publication date: 26 November 2001
Full work available at URL: https://doi.org/10.2307/2589113
Applications of mathematical programming (90C90) Integer programming (90C10) Case-oriented studies in operations research (90B90)
Related Items (only showing first 100 items - show all)
Computing Roman domatic number of graphs ⋮ Algorithmic aspects of total Roman and total double Roman domination in graphs ⋮ Improved integer linear programming formulation for weak Roman domination problem ⋮ Some progress on the double Roman domination in graphs ⋮ Unnamed Item ⋮ Roman domination dot-critical graphs ⋮ Relating the outer-independent total Roman domination number with some classical parameters of graphs ⋮ Outer independent Roman dominating functions in 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 ⋮ Maximal 2-rainbow domination number of a graph ⋮ Double Roman domination ⋮ A note on Roman domination in graphs ⋮ Relations between the Roman k-domination and Roman domination numbers in graphs ⋮ Bounds on the double Italian domination number of a graph ⋮ Perfect Italian domination in graphs: complexity and algorithms ⋮ The roman \(k\)-domatic number of a graph ⋮ On the strong Roman domination number of graphs ⋮ Triple Roman domination in graphs ⋮ Perfect Italian domination in cographs ⋮ Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between ⋮ Extremal graphs for a bound on the Roman domination number ⋮ Independent Roman domination and 2-independence in trees ⋮ On the double Roman domination in graphs ⋮ Roman domination on strongly chordal graphs ⋮ Exact algorithms for weak Roman domination ⋮ Mixed Roman domination in graphs ⋮ Total Roman domination in the lexicographic product of graphs ⋮ Roman \(\{ 3 \}\)-domination (double Italian domination) ⋮ Bounds on the locating Roman domination number in trees ⋮ Perfect Roman domination in trees ⋮ Independent Roman \(\{2 \}\)-domination in graphs ⋮ Tight bounds for eternal dominating sets in graphs ⋮ 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 ⋮ Nordhaus-Gaddum bounds for total Roman domination ⋮ Defending the Roman Empire from multiple attacks ⋮ Some improved inequalities related to Vizing's conjecture ⋮ On the global Roman domination number in graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Graphs with large Italian domination number ⋮ Independent double Roman domination in graphs ⋮ Signed Roman domination in graphs ⋮ On the co-Roman domination in graphs ⋮ On the total Roman domination in trees ⋮ Roman domination in graphs. ⋮ On the Roman bondage number of planar graphs ⋮ On roman, global and restrained domination in graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Signed double Roman domination in graphs ⋮ A note on the double Roman domination number of graphs ⋮ The Roman \(\{2 \}\)-domatic number of graphs ⋮ A characterization of double Roman trees ⋮ Roman dominating influence parameters ⋮ Perfect Italian domination in trees ⋮ Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\) ⋮ Roman game domination number of a graph ⋮ Upper bounds for the domination subdivision and bondage numbers of graphs on topological surfaces ⋮ Process flexibility: design, evaluation, and applications ⋮ ON THE ROMAN BONDAGE NUMBER OF A GRAPH ⋮ Mixed Roman domination and 2-independence in trees ⋮ Some progress on the restrained Roman domination ⋮ Quasi-total Roman domination in graphs ⋮ Unique response Roman domination in graphs ⋮ Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination ⋮ Trees with independent Roman domination number twice the independent domination number ⋮ The roman domatic number of a graph ⋮ Note on the perfect Roman domination number of graphs ⋮ A note on the eternal dominating set problem ⋮ Critical graphs with Roman domination number four ⋮ Efficient algorithms for Roman domination on some classes of graphs ⋮ Algorithmic results on double Roman domination in graphs ⋮ Roman Domination in Graphs ⋮ Eternal and Secure Domination in Graphs ⋮ Algorithmic aspects of Roman domination in graphs ⋮ Independent double Roman domination in graphs ⋮ Roman domination in graphs: The class ℛUV R ⋮ Algorithmic and complexity aspects of problems related to total Roman domination for graphs ⋮ The Roman domination number of some special classes of graphs - convex polytopes ⋮ Double Roman domination and domatic numbers of graphs ⋮ Roman domination in regular graphs ⋮ On the Roman domination number of a graph ⋮ Total Roman reinforcement in graphs ⋮ Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number ⋮ Roman domination in unicyclic graphs ⋮ Perfect double Roman domination of trees ⋮ Unnamed Item ⋮ Roman domination problem with uncertain positioning and deployment costs ⋮ Computing strong Roman domination of trees and unicyclic graphs in linear time ⋮ On the Roman domination subdivision number of a graph ⋮ Eternally dominating large grids ⋮ Perfect Roman domination in graphs ⋮ On the double Roman domination of graphs ⋮ INVERSE ROMAN DOMINATION IN GRAPHS ⋮ Global Roman domination in trees
This page was built for publication: Defendens Imperium Romanum: A Classical Problem in Military Strategy
