Pages that link to "Item:Q2860863"
From MaRDI portal
The following pages link to Strong equality between the Roman domination and independent Roman domination numbers in trees (Q2860863):
Displaying 19 items.
- Strong equality of Roman and weak Roman domination in trees (Q284830) (← links)
- Double Roman domination (Q335328) (← links)
- A note on Roman domination of digraphs (Q1630917) (← links)
- Some progress on the double Roman domination in graphs (Q1630922) (← links)
- Mixed Roman domination in graphs (Q1684257) (← links)
- Double Roman domination number (Q1752604) (← links)
- Complexity aspects of variants of independent Roman domination in graphs (Q2666348) (← links)
- Trees with strong equality between the roman domination number and the unique response Roman domination number (Q2869464) (← links)
- Trees with unique Roman dominating functions of minimum weight (Q2920886) (← links)
- Varieties of Roman Domination (Q3384116) (← links)
- A characterization of Roman trees (Q4435567) (← links)
- Trees with equal strong Roman domination number and Roman domination number (Q4968617) (← links)
- Independent roman $\{3\}$-domination (Q5103952) (← links)
- Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers (Q5134329) (← links)
- On trees with equal Roman domination and outer-independent Roman domination numbers (Q5242949) (← links)
- A Roman domination chain (Q5964976) (← 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)
- Closed formulas for the independent (Roman) domination number of rooted product graphs (Q6125366) (← links)
