Pages that link to "Item:Q2331583"
From MaRDI portal
The following pages link to On perfect Roman domination number in trees: complexity and bounds (Q2331583):
Displaying 14 items.
- Constructive characterizations concerning weak Roman domination in trees (Q777409) (← links)
- Perfect Roman domination in trees (Q1693150) (← links)
- A new upper bound for the perfect Italian domination number of a tree (Q2151228) (← links)
- A characterization of perfect Roman trees (Q2197463) (← links)
- A constructive characterization of vertex cover Roman trees (Q2214322) (← links)
- Note on the perfect Roman domination number of graphs (Q2284084) (← links)
- Perfect Roman domination in graphs (Q2333784) (← links)
- Varieties of Roman Domination (Q3384116) (← links)
- On the computational complexity aspects of perfect Roman domination (Q5046034) (← links)
- Perfect Roman domination in middle graphs (Q5051448) (← links)
- (Q5061786) (← links)
- On the perfect differential of a graph (Q5070495) (← links)
- Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs (Q5075513) (← links)
- Perfect roman domination in regular graphs (Q5155702) (← links)