Signed Roman \(k\)-domination in trees

DOI10.1016/j.dam.2015.01.019zbMath1311.05150OpenAlexW2062564751MaRDI QIDQ2345601

Michael A. Henning, Lutz Volkmann

Publication date: 22 May 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.01.019

zbMATH Keywords

signed Roman \(k\)-dominating functionsigned Roman \(k\)-domination number

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (13)

Bounds on the signed Roman \(k\)-domination number of a digraph ⋮ On the signed Roman \(k\)-domination: complexity and thin torus graphs ⋮ On the \(k\)-strong Roman domination problem ⋮ On the signed Roman k-domination in graphs ⋮ Unnamed Item ⋮ Signed double Roman domination in graphs ⋮ 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 DOMINATION NUMBER AND JOIN OF GRAPHS ⋮ Weak signed Roman domination in graphs ⋮ Weak Signed Roman Domination in Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Signed Roman domination in digraphs
• A note on the lower bounds of signed domination number of a graph
• Signed domination in regular graphs and set-systems
• Signed domination in regular graphs
• Signed Roman domination in graphs
• Signed Roman \(k\)-domination in graphs

This page was built for publication: Signed Roman \(k\)-domination in trees