Signed Roman \(k\)-domination in digraphs

DOI10.1007/S00373-015-1641-3zbMath1338.05104OpenAlexW4234036518MaRDI QIDQ293661

Lutz Volkmann

Publication date: 9 June 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1641-3

zbMATH Keywords

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

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (9)

Bounds on the signed Roman \(k\)-domination number of a digraph ⋮ The Roman domatic problem in graphs and digraphs: a survey ⋮ On the signed Roman \(k\)-domination: complexity and thin torus graphs ⋮ Weak signed Roman k-domination in digraphs ⋮ On the signed Roman k-domination in graphs ⋮ Unnamed Item ⋮ Bounds for signed double Roman k-domination in trees ⋮ Unnamed Item ⋮ Weak Signed Roman Domination in Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Signed Roman domination in digraphs
• The signed \(k\)-domination number of directed graphs
• Lower bounds on the signed domination numbers of directed graphs
• Signed Roman domination in graphs
• Signed domination and signed domatic numbers of digraphs
• Signed domination numbers of directed graphs
• Signed Roman \(k\)-domination in graphs

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