Bounds on the signed Roman \(k\)-domination number of a digraph

DOI10.7151/dmgt.2068zbMath1401.05213OpenAlexW2796278791MaRDI QIDQ1630924

Lutz Volkmann, Xiaodan Chen, Guoliang Hao

Publication date: 5 December 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2068

zbMATH Keywords

digraphoriented treesigned 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

Weak signed Roman k-domination in digraphs, Unnamed Item, Weak Signed Roman Domination in Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Signed Roman \(k\)-domination in digraphs
• Directed domination in oriented graphs
• Signed Roman domination in digraphs
• Bounds on the disjunctive total domination number of a tree
• Signed Roman \(k\)-domination in trees
• Signed Roman domination in graphs
• Total outer-connected domination in trees
• Signed domination numbers of directed graphs
• Signed Roman \(k\)-domination in graphs