On the signed strong Roman domination number of graphs

DOI10.1142/S1793830920500287MaRDI QIDQ4965895zbMATH OpenOpenAlexFDO

Authors

Publication date 18 March 2021

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830920500287

zbMATH Keywords

dominationRoman dominationRoman domination numberstrong Roman domination

Mathematics Subject Classification ID

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

Recommendations

• Signed strong Roman domination in graphs
• Signed Total Strong Roman Domination in Graphs
• Signed Roman domination in graphs
• On the signed total Roman domination and domatic numbers of graphs
• Signed total Roman domination in graphs

Cites work

• Signed domination in regular graphs
• Signed Roman domination in digraphs
• Signed Roman domination in graphs
• Signed strong Roman domination in graphs
• The minus \(k\)-domination numbers in graphs

Cited in

(10)

• On the strong signed total domination number of a graph
• The signed Roman domination number of two classes graphs
• Signed strong Roman domination in graphs
• Strong signed reinforcement numbers of several graphs.
• Signed Total Strong Roman Domination in Graphs
• scientific article; zbMATH DE number 7266465 (Why is no real title available?)
• Strong Roman domination in grid graphs
• γ-induced-paired dominating graphs of paths and cycles
• Twin signed double Roman domination numbers in directed graphs
• On the signed strong total Roman domination number of graphs

This page was built for publication: On the signed strong Roman domination number of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965895)