Upper bounds on the k-tuple (Roman) domination number of a graph
From MaRDI portal
Publication:2657089
Recommendations
- Improved bounds on the \(k\)-tuple (Roman) domination number of a graph
- scientific article; zbMATH DE number 5289574
- On the k-domination, k-tuple domination and Roman k-domination numbers in graphs
- Improved upper bounds for the k-tuple domination number
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
Cites work
- Double Roman domination
- scientific article; zbMATH DE number 3531438 (Why is no real title available?)
- New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
- On the k-domination, k-tuple domination and Roman k-domination numbers in graphs
- Roman \(k\)-domination in graphs
- Roman domination in graphs.
- Some progress on the double Roman domination in graphs
- Total domination in graphs
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
Cited in
(5)
This page was built for publication: Upper bounds on the \(k\)-tuple (Roman) domination number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2657089)