A note on the independent Roman domination in unicyclic graphs
From MaRDI portal
Publication:4908863
Recommendations
- Note on the independent Roman domination number of a graph
- Roman domination in unicyclic graphs
- Independent Roman \(\{2 \}\)-domination in graphs
- Further results on the independent Roman domination number of graphs
- Characterization of Roman domination critical unicyclic graphs
- A note on Roman domination in graphs
- A note on Roman domination in graphs
- On the independent double Roman domination in graphs
- Bounds for independent Roman domination in graphs.
- Properties of independent Roman domination in graphs
Cited in
(15)- Independent double Roman domination in graphs
- Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers
- Note on the independent Roman domination number of a graph
- Bounds on the outer-independent Roman domination number of unicyclic and bicyclic graphs
- Independent Roman domination and 2-independence in trees
- Trees with independent Roman domination number twice the independent domination number
- A Roman domination chain
- Roman domination in unicyclic graphs
- Mixed Roman domination in graphs
- Characterization of Roman domination critical unicyclic graphs
- Lower and upper bounds on independent double Roman domination in trees
- On the strong Roman domination number of graphs
- Roman domination and independent Roman domination on graphs with maximum degree three
- Independent double Roman domination in graphs
- Outer-independent total Roman domination in graphs
This page was built for publication: A note on the independent Roman domination in unicyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4908863)
