Signed mixed Roman domination numbers in graphs

DOI10.1007/S10878-015-9879-5zbMath1352.05140OpenAlexW2090187806MaRDI QIDQ328725

Lutz Volkmann, Seyyed Mahmoud Sheikholeslami, Hossein Abdollahzadeh Ahangar, Leila Asgharsharghi

Publication date: 20 October 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9879-5

zbMATH Keywords

signed Roman dominating functionsigned Roman domination numbersigned mixed Roman dominating functionsigned mixed Roman domination number

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)

Related Items (3)

Bounds on signed total double Roman domination ⋮ Varieties of Roman domination II ⋮ Rainbow edge domination numbers in graphs

Cites Work

• The algorithmic complexity of mixed domination in graphs
• On total matching numbers and total covering numbers of complementary graphs
• On the algorithmic complexity of twelve covering and independence parameters of graphs
• On the mixed domination problem in graphs
• Signed Roman domination in graphs
• A lower bound on the total signed domination numbers of graphs
• On signed edge domination numbers of trees
• Total matchings and total coverings of graphs
• The signed Roman domatic number of a digraph
• Signed mixed dominating functions in complete bipartite graphs
• Signed Roman edge domination numbers in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Signed mixed Roman domination numbers in graphs