The signed Roman k-domatic number of a graph
From MaRDI portal
Recommendations
- The signed total Roman \(k\)-domatic number of a graph
- The signed Roman domatic number of a graph
- Signed Roman \(k\)-domination in graphs
- Signed total Roman \(k\)-domination in graphs
- Signed \((k,k)\)-domatic number of a graph
- Weak signed Roman \(k\)-domatic number of a graph
- On the signed Roman k-domination in graphs
- Signed Roman edge \(k\)-domination in graphs
- Signed Roman \(k\)-domination in digraphs
- Signed \{\(k\)\}-domatic numbers of graphs
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1750101 (Why is no real title available?)
- On Complementary Graphs
- Signed Roman \(k\)-domination in graphs
- Signed Roman domination in digraphs
- Signed Roman domination in graphs
- The signed Roman domatic number of a graph
- The signed \(k\)-domination numbers in graphs.
- Towards a theory of domination in graphs
Cited in
(12)- Weak signed Roman \(k\)-domatic number of a graph
- Signed double Roman \(k\)-domination in graphs
- The signed Roman \(k\)-domatic number of digraphs
- Bounds for signed double Roman
- On the signed Roman \(k\)-domination: complexity and thin torus graphs
- The signed total Roman \(k\)-domatic number of a graph
- The Roman domatic problem in graphs and digraphs: a survey
- The signed Roman domatic number of a graph
- The roman \(k\)-domatic number of a graph
- On the signed Roman k-domination in graphs
- Several Roman domination graph invariants on Kneser graphs
- The signed edge-domatic number of nearly cubic graphs
This page was built for publication: The signed Roman \(k\)-domatic number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476316)