Pages that link to "Item:Q2666348"
From MaRDI portal
The following pages link to Complexity aspects of variants of independent Roman domination in graphs (Q2666348):
Displaying 5 items.
- Independent roman $\{3\}$-domination (Q5103952) (← links)
- Further results on the independent Roman domination number of graphs (Q6039055) (← links)
- Efficient algorithms for independent Roman domination on some classes of graphs (Q6097713) (← links)
- Roman domination and independent Roman domination on graphs with maximum degree three (Q6124437) (← links)
- Complexity aspects of restrained Roman domination in graphs (Q6132244) (← links)