Signed Roman k-domination in trees
From MaRDI portal
Publication:2345601
Recommendations
Cites work
- A note on the lower bounds of signed domination number of a graph
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1124595 (Why is no real title available?)
- scientific article; zbMATH DE number 861417 (Why is no real title available?)
- Signed domination in regular graphs
- Signed domination in regular graphs and set-systems
- Signed Roman \(k\)-domination in graphs
- Signed Roman domination in digraphs
- Signed Roman domination in graphs
Cited in
(17)- Bounds on the signed Roman \(k\)-domination number of a digraph
- Signed double Roman domination in graphs
- On the \(k\)-strong Roman domination problem
- On the signed Roman k-domination: complexity and thin torus graphs
- Signed double Roman \(k\)-domination in graphs
- Varieties of Roman domination. II
- SIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS
- Weak signed Roman domination in graphs
- Weak signed Roman domination in digraphs
- Signed Roman edge k-domination in graphs
- On the signed Roman k-domination in graphs
- Bounds for signed double Roman
- Signed total Italian domination in digraphs
- More results on the signed double Roman domination number of graphs
- The signed (total) Roman domination problem on some classes of planar graphs -- convex polytopes
- Weak signed double Roman domination in graphs
- Weak signed total Italian domination in digraphs
This page was built for publication: Signed Roman \(k\)-domination in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2345601)