Closed formulas for the independent (Roman) domination number of rooted product graphs
From MaRDI portal
Publication:6125366
Recommendations
Cites work
- scientific article; zbMATH DE number 3477211 (Why is no real title available?)
- A new graph product and its spectrum
- A note on the independent domination number versus the domination number in bipartite graphs.
- Domination, independent domination and \(k\)-independence in trees
- Domination-related parameters in rooted product graphs
- Further results on the independent Roman domination number of graphs
- Independent Roman domination and 2-independence in trees
- Independent domination in bipartite cubic graphs
- Independent domination in graphs: A survey and recent results
- Independent domination in subcubic graphs
- Lower bounds on the roman and independent roman domination numbers
- Note on the independent Roman domination number of a graph
- Roman domination in graphs.
- Strong equality between the Roman domination and independent Roman domination numbers in trees
- Towards a theory of domination in graphs
This page was built for publication: Closed formulas for the independent (Roman) domination number of rooted product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6125366)