Signed Roman \(k\)-domination in graphs
From MaRDI portal
Publication:5964984
DOI10.1007/s00373-015-1536-3zbMath1331.05170OpenAlexW2149847352MaRDI QIDQ5964984
Lutz Volkmann, Michael A. Henning
Publication date: 2 March 2016
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-015-1536-3
Related Items (20)
Signed Roman \(k\)-domination in digraphs ⋮ Bounds on the signed Roman \(k\)-domination number of a digraph ⋮ The Roman domatic problem in graphs and digraphs: a survey ⋮ Unnamed Item ⋮ On the signed Roman \(k\)-domination: complexity and thin torus graphs ⋮ Weak signed Roman k-domination in digraphs ⋮ On the \(k\)-strong Roman domination problem ⋮ On the signed Roman k-domination in graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The signed Roman \(k\)-domatic number of a graph ⋮ Signed double Roman domination in graphs ⋮ A characterization of double Roman trees ⋮ Signed Roman edge \(k\)-domination in graphs ⋮ Varieties of Roman domination II ⋮ Bounds for signed double Roman k-domination in trees ⋮ Unnamed Item ⋮ Signed Roman \(k\)-domination in trees ⋮ Weak signed Roman domination in graphs ⋮ Weak Signed Roman Domination in Digraphs
Cites Work
This page was built for publication: Signed Roman \(k\)-domination in graphs