Signed double Roman k-domination in graphs
From MaRDI portal
Publication:4622604
zbMATH Open1405.05131MaRDI QIDQ4622604FDOQ4622604
Authors: Hong Yang, Zehui Shao, J. Amjadi, Sakineh Nazari-Moghaddam, Seyed Mahmood Sheikholeslami 
Publication date: 13 February 2019
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/72/ajc_v72_p082.pdf
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Signed Roman domination in graphs
- Signed Roman \(k\)-domination in digraphs
- Signed Roman domination in digraphs
- Signed Roman \(k\)-domination in graphs
- The signed Roman domatic number of a digraph
- Signed domination in regular graphs
- Double Roman domination
- The signed Roman \(k\)-domatic number of a graph
- Signed Roman \(k\)-domination in trees
- Double Roman domination in trees
- On the double Roman domination in graphs
- Double Roman domination and domatic numbers of graphs
- An upper bound on the double Roman domination number
- On the signed Roman \(k\)-domination: complexity and thin torus graphs
- Title not available (Why is that?)
- Total Roman reinforcement in graphs
- The signed Roman \(k\)-domatic number of digraphs
Cited In (5)
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)
