Pages that link to "Item:Q2335792"
From MaRDI portal
The following pages link to On the double Roman domination of graphs (Q2335792):
Displaying 19 items.
- Perfect double Roman domination of trees (Q777364) (← links)
- Some progress on the restrained Roman domination (Q2021658) (← links)
- Percolation behaviors of partially edge-coupled interdependent networks (Q2079054) (← links)
- Restrained condition on double Roman dominating functions (Q2096308) (← links)
- Algorithm and hardness results in double Roman domination of graphs (Q2118874) (← links)
- Outer independent signed double Roman domination (Q2142485) (← links)
- On algorithmic complexity of double Roman domination (Q2197468) (← links)
- Integer linear programming models for the weighted total domination problem (Q2279352) (← links)
- Outer independent double Roman domination (Q2284046) (← links)
- Domination in hexagonal chains (Q2287557) (← links)
- Algorithmic results on double Roman domination in graphs (Q2292130) (← links)
- Extremal digraphs for an upper bound on the double Roman domination number (Q2305613) (← links)
- Perfect Italian domination in cographs (Q2661056) (← links)
- The restrained double Roman domination in graphs (Q2683144) (← links)
- ALGORITHMIC ASPECTS OF ROMAN GRAPHS (Q4956471) (← links)
- Integer linear programming formulations for double roman domination problem (Q5038168) (← links)
- A linear algorithm for double Roman domination of proper interval graphs (Q5216450) (← links)
- Critical concept for double Roman domination in graphs (Q5854749) (← links)
- Unique response Roman domination: complexity and algorithms (Q6088304) (← links)
