Pages that link to "Item:Q1810648"
From MaRDI portal
The following pages link to Defending the Roman Empire---a new strategy (Q1810648):
Displaying 50 items.
- Roman \(\{2 \}\)-domination (Q266795) (← links)
- Strong equality of Roman and weak Roman domination in trees (Q284830) (← links)
- The \(\mathbb{N}_k\)-valued Roman domination and its boundaries (Q324921) (← links)
- Upper secure domination number of a graph (Q327666) (← links)
- Double Roman domination (Q335328) (← links)
- Roman domination on strongly chordal graphs (Q385486) (← links)
- Independent protection in graphs (Q400447) (← links)
- Combinatorics for smaller kernels: the differential of a graph (Q476877) (← links)
- Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
- Constructive characterizations concerning weak Roman domination in trees (Q777409) (← links)
- Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
- On unique minimum dominating sets in some Cartesian product graphs (Q891308) (← links)
- Global Roman domination in graphs (Q906445) (← links)
- Efficient algorithms for Roman domination on some classes of graphs (Q1003729) (← links)
- Secure domination critical graphs (Q1045117) (← links)
- Defending the Roman Empire from multiple attacks (Q1408869) (← links)
- Improved integer linear programming formulation for weak Roman domination problem (Q1626222) (← links)
- Some progress on the double Roman domination in graphs (Q1630922) (← links)
- Extremal problems on weak Roman domination number (Q1653022) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- Independent Roman \(\{2 \}\)-domination in graphs (Q1693166) (← links)
- On the co-Roman domination in graphs (Q1717198) (← links)
- On the total Roman domination in trees (Q1717206) (← links)
- Double Roman domination number (Q1752604) (← links)
- Secure Italian domination in graphs (Q2025095) (← links)
- Italian domination of Cartesian products of directed cycles (Q2028072) (← links)
- Algorithmic aspects of Roman domination in graphs (Q2053064) (← links)
- Protection of lexicographic product graphs (Q2062678) (← links)
- Weak Roman domination in rooted product graphs (Q2144851) (← links)
- Total protection of lexicographic product graphs (Q2151225) (← links)
- On the \(k\)-strong Roman domination problem (Q2197424) (← links)
- From (secure) \(w\)-domination in graphs to protection of lexicographic product graphs (Q2239006) (← links)
- Algorithmic results on double Roman domination in graphs (Q2292130) (← links)
- Approximation algorithm for a generalized Roman domination problem in unit ball graphs (Q2292134) (← links)
- Effect of vertex deletion on the weak Roman domination number of a graph (Q2293840) (← links)
- Weakly connected Roman domination in graphs (Q2322879) (← links)
- Eternally dominating large grids (Q2328863) (← links)
- Co-Roman domination in graphs (Q2344075) (← links)
- On the strong Roman domination number of graphs (Q2403792) (← links)
- On the double Roman domination in graphs (Q2410217) (← links)
- Exact algorithms for weak Roman domination (Q2413969) (← links)
- On the weak Roman domination number of lexicographic product graphs (Q2420431) (← links)
- Tight bounds for eternal dominating sets in graphs (Q2427517) (← links)
- Signed Roman domination in graphs (Q2444148) (← links)
- Roman dominating influence parameters (Q2463905) (← links)
- Triple Roman domination in graphs (Q2661014) (← links)
- Graphs with small Italian domatic number (Q2700605) (← links)
- Roman domination in unicyclic graphs (Q2833278) (← links)
- INVERSE ROMAN DOMINATION IN GRAPHS (Q2864853) (← links)
- Outer independent Roman dominating functions in graphs (Q3177476) (← links)
