Pages that link to "Item:Q2333784"
From MaRDI portal
The following pages link to Perfect Roman domination in graphs (Q2333784):
Displaying 21 items.
- Roman domination on strongly chordal graphs (Q385486) (← links)
- Efficient algorithms for Roman domination on some classes of graphs (Q1003729) (← links)
- Perfect Roman domination in trees (Q1693150) (← links)
- Double vertex-edge domination in graphs: complexity and algorithms (Q2053214) (← links)
- Perfect Italian domination in graphs: complexity and algorithms (Q2161253) (← links)
- A linear-time algorithm for weighted paired-domination on block graphs (Q2168726) (← links)
- Note on the perfect Roman domination number of graphs (Q2284084) (← links)
- On perfect Roman domination number in trees: complexity and bounds (Q2331583) (← links)
- Perfect Italian domination in cographs (Q2661056) (← links)
- The restrained double Roman domination in graphs (Q2683144) (← links)
- Total Roman domination for proper interval graphs (Q4958006) (← 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)
- Domination problems on P<sub>5</sub>-free graphs (Q5248877) (← links)
- Unique response Roman domination: complexity and algorithms (Q6088304) (← links)
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms (Q6558691) (← links)
- On maximal Roman domination in graphs: complexity and algorithms (Q6593946) (← links)
