Pages that link to "Item:Q2312053"
From MaRDI portal
The following pages link to Total Roman reinforcement in graphs (Q2312053):
Displaying 24 items.
- A note on total reinforcement in graphs (Q642968) (← links)
- Total Roman \(\{2\}\)-reinforcement of graphs (Q2035667) (← links)
- Reinforcement number of a graph with respect to half-domination (Q2035727) (← links)
- Global triple Roman dominating function (Q2127628) (← links)
- On the total and strong version for Roman dominating functions in graphs (Q2662879) (← links)
- Varieties of Roman Domination (Q3384116) (← links)
- Roman Domination in Graphs (Q3384614) (← links)
- (Q4622604) (← links)
- Double Roman domination and domatic numbers of graphs (Q4635028) (← links)
- Total Roman domatic number of a graph (Q4985437) (← links)
- (Q5021092) (← links)
- Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties (Q5074890) (← links)
- Bounds for signed double Roman <i>k</i>-domination in trees (Q5242363) (← links)
- (Q5284099) (← links)
- Total k-rainbow reinforcement number in graphs (Q5859516) (← links)
- On the total Roman domination stability in graphs (Q5861706) (← links)
- Double Roman reinforcement number in graphs (Q5861712) (← links)
- Restrained k-rainbow reinforcement number in graphs (Q5876873) (← links)
- RESTRAINED ROMAN REINFORCEMENT NUMBER IN GRAPHS (Q5884738) (← links)
- Quasi-total Roman reinforcement in graphs (Q6110872) (← links)
- (Q6155858) (← links)
- (Q6159868) (← links)
- Approximation algorithm for the minimum partial connected Roman dominating set problem (Q6571270) (← links)
- An upper bound on the total Roman \(\{2\}\)-domination number of graphs with minimum degree two (Q6580152) (← links)
