Pages that link to "Item:Q741531"
From MaRDI portal
The following pages link to Bounds on weak Roman and 2-rainbow domination numbers (Q741531):
Displaying 29 items.
- Roman \(\{2 \}\)-domination (Q266795) (← links)
- Strong equality of Roman and weak Roman domination in trees (Q284830) (← links)
- Constructive characterizations concerning weak Roman domination in trees (Q777409) (← links)
- Improved integer linear programming formulation for weak Roman domination problem (Q1626222) (← links)
- Extremal problems on weak Roman domination number (Q1653022) (← links)
- Upper bound on 3-rainbow domination in graphs with minimum degree 2 (Q1662645) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- Independent Roman \(\{2 \}\)-domination in graphs (Q1693166) (← links)
- On 2-rainbow domination of generalized Petersen graphs (Q1730265) (← links)
- General upper bounds on independent \(k\)-rainbow domination (Q1732101) (← links)
- Relating the annihilation number and the 2-domination number of block graphs (Q1741511) (← links)
- Secure Italian domination in graphs (Q2025095) (← 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)
- From (secure) \(w\)-domination in graphs to protection of lexicographic product graphs (Q2239006) (← links)
- A note on total domination and 2-rainbow domination in graphs (Q2341773) (← links)
- Relating 2-rainbow domination to Roman domination (Q2409786) (← links)
- On the total and strong version for Roman dominating functions in graphs (Q2662879) (← links)
- Varieties of Roman Domination (Q3384116) (← links)
- Rainbow Domination in Graphs (Q3384615) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- (Q4820838) (← links)
- Bounds on the co-Roman domination number in graphs (Q4985578) (← links)
- Trees with equal total domination and 2-rainbow domination numbers (Q5014384) (← links)
- Vertex-Edge Roman Domination (Q5035233) (← links)
- Protection of graphs with emphasis on Cartesian product graphs (Q5080300) (← links)
- (Q5197584) (← links)
- Double vertex-edge domination (Q5370818) (← links)