Pages that link to "Item:Q2403792"
From MaRDI portal
The following pages link to On the strong Roman domination number of graphs (Q2403792):
Displaying 21 items.
- Roman domination problem with uncertain positioning and deployment costs (Q781325) (← links)
- Computing strong Roman domination of trees and unicyclic graphs in linear time (Q2082401) (← links)
- Extremal graphs for a bound on the Roman domination number (Q2175235) (← links)
- On the \(k\)-strong Roman domination problem (Q2197424) (← links)
- Weakly connected Roman domination in graphs (Q2322879) (← links)
- Outer-independent total Roman domination in graphs (Q2328098) (← links)
- On \(k\)-rainbow independent domination in graphs (Q2335156) (← links)
- Roman dominating influence parameters (Q2463905) (← links)
- Triple Roman domination in graphs (Q2661014) (← links)
- On the total and strong version for Roman dominating functions in graphs (Q2662879) (← links)
- Varieties of Roman Domination (Q3384116) (← links)
- The Roman domination number of some special classes of graphs - convex polytopes (Q3390794) (← links)
- Trees with equal strong Roman domination number and Roman domination number (Q4968617) (← links)
- On the roman domination number of generalized Sierpiński graphs (Q5023115) (← links)
- Unique response strong Roman dominating functions of graphs (Q5061702) (← links)
- (Q5129468) (← links)
- (Q5215892) (← links)
- Trees with equal Roman {2}-domination number and independent Roman {2}-domination number (Q5242342) (← links)
- On Hop Roman Domination in Trees (Q5242950) (← links)
- Roman domination in Cartesian product graphs and strong product graphs (Q5259399) (← links)
- On the outer independent total double Roman domination in graphs (Q6042155) (← links)
