The following pages link to ROMAN k-DOMINATION IN GRAPHS (Q3652891):
Displaying 16 items.
- The \(\mathbb{N}_k\)-valued Roman domination and its boundaries (Q324921) (← links)
- The roman \(k\)-domatic number of a graph (Q353534) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- A note on Roman domination in graphs (Q856892) (← links)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- Bounds on the locating Roman domination number in trees (Q1692624) (← links)
- Improved bounds on the \(k\)-tuple (Roman) domination number of a graph (Q2121485) (← links)
- The Roman domatic problem in graphs and digraphs: a survey (Q2151218) (← links)
- On the \(k\)-strong Roman domination problem (Q2197424) (← links)
- Outer-independent total Roman domination in graphs (Q2328098) (← links)
- On perfect Roman domination number in trees: complexity and bounds (Q2331583) (← links)
- On the strong Roman domination number of graphs (Q2403792) (← links)
- Upper bounds on the \(k\)-tuple (Roman) domination number of a graph (Q2657089) (← links)
- Relations between the Roman k-domination and Roman domination numbers in graphs (Q2920894) (← links)
- Varieties of Roman Domination (Q3384116) (← links)
- Roman k-tuple domination number of a graph (Q5164960) (← links)
