The following pages link to Signed Roman domination in graphs (Q2444148):
Displaying 50 items.
- Computing Roman domatic number of graphs (Q284340) (← links)
- Signed Roman \(k\)-domination in digraphs (Q293661) (← links)
- On the signed total Roman domination and domatic numbers of graphs (Q317425) (← links)
- Signed total Roman domination in graphs (Q326484) (← links)
- Signed mixed Roman domination numbers in graphs (Q328725) (← links)
- Edge Roman domination on graphs (Q343714) (← links)
- The signed Roman \(k\)-domatic number of a graph (Q476316) (← links)
- Signed Roman domination in digraphs (Q498421) (← links)
- Signed Roman edge \(k\)-domination in graphs (Q505464) (← links)
- Improved integer linear programming formulation for weak Roman domination problem (Q1626222) (← links)
- Bounds on the signed Roman \(k\)-domination number of a digraph (Q1630924) (← links)
- Bounds on the locating Roman domination number in trees (Q1692624) (← links)
- Bounds on the domination number of a digraph (Q1698058) (← links)
- Signed double Roman domination in graphs (Q1730213) (← links)
- A characterization of double Roman trees (Q1735679) (← links)
- Double Roman domination number (Q1752604) (← links)
- The Roman domatic problem in graphs and digraphs: a survey (Q2151218) (← links)
- Perfect Italian domination in graphs: complexity and algorithms (Q2161253) (← links)
- The signed edge-domatic number of nearly cubic graphs (Q2168740) (← links)
- On the \(k\)-strong Roman domination problem (Q2197424) (← links)
- Double Roman domination in digraphs (Q2272602) (← links)
- Algorithmic results on double Roman domination in graphs (Q2292130) (← links)
- Outer-independent total Roman domination in graphs (Q2328098) (← links)
- On perfect Roman domination number in trees: complexity and bounds (Q2331583) (← links)
- Perfect Roman domination in graphs (Q2333784) (← links)
- Signed Roman \(k\)-domination in trees (Q2345601) (← links)
- On the strong Roman domination number of graphs (Q2403792) (← links)
- On the signed Roman \(k\)-domination: complexity and thin torus graphs (Q2410261) (← links)
- Total Roman domination in the lexicographic product of graphs (Q2420413) (← links)
- Perfect Italian domination in cographs (Q2661056) (← links)
- (Q4622604) (← links)
- Roman domination excellent graphs: trees (Q4635024) (← links)
- Varieties of Roman domination II (Q4956207) (← links)
- SIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS (Q4956381) (← links)
- Weak signed Roman domination in graphs (Q4957521) (← links)
- Bounds on signed total double Roman domination (Q4957530) (← links)
- (Q4957533) (← links)
- The signed Roman domination number of two classes graphs (Q4965890) (← links)
- On the signed strong Roman domination number of graphs (Q4965895) (← links)
- The signed Roman domatic number of a digraph (Q5006556) (← links)
- Majority Roman domination in graphs (Q5025135) (← links)
- Weak Signed Roman Domination in Digraphs (Q5029318) (← links)
- On the signed Roman <i>k</i>-domination in graphs (Q5129754) (← links)
- (Q5205520) (← links)
- Signed total double Roman k-domination in graphs (Q5216448) (← links)
- Bounds for signed double Roman <i>k</i>-domination in trees (Q5242363) (← links)
- On trees with equal Roman domination and outer-independent Roman domination numbers (Q5242949) (← links)
- Signed Roman edge domination numbers in graphs (Q5963625) (← links)
- Signed Roman \(k\)-domination in graphs (Q5964984) (← links)
- Unique response Roman domination: complexity and algorithms (Q6088304) (← links)