Signed double Roman k-domination in graphs
From MaRDI portal
Publication:4622604
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 6889679 (Why is no real title available?)
- An upper bound on the double Roman domination number
- Double Roman domination
- Double Roman domination and domatic numbers of graphs
- Double Roman domination in trees
- On the double Roman domination in graphs
- On the signed Roman \(k\)-domination: complexity and thin torus graphs
- Signed Roman \(k\)-domination in digraphs
- Signed Roman \(k\)-domination in graphs
- Signed Roman \(k\)-domination in trees
- Signed Roman domination in digraphs
- Signed Roman domination in graphs
- Signed domination in regular graphs
- The signed Roman \(k\)-domatic number of a graph
- The signed Roman \(k\)-domatic number of digraphs
- The signed Roman domatic number of a digraph
- Total Roman reinforcement in graphs
Cited in
(10)- Signed double Roman domination in graphs
- Signed total double Roman \(k\)-domination in graphs
- Bounds for signed double Roman
- Outer independent signed double Roman domination
- Weak signed Roman \(k\)-domination in graphs
- Signed Roman \(k\)-domination in graphs
- On the signed Roman k-domination in graphs
- Bounds on signed total double Roman domination
- Signed double roman domination of graphs
- Signed double Roman domination on cubic graphs
This page was built for publication: Signed double Roman \(k\)-domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4622604)