The signed Roman domination number of two classes graphs

DOI10.1142/S179383092050024XzbMath1456.05131OpenAlexW3003884176MaRDI QIDQ4965890

Huihui Zhang, Tianhu Yu, Xia Hong, Zhengbang Zha

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/s179383092050024x

zbMATH Keywords

spidersigned Roman dominating functiondouble starsigned Roman domination numbers

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

γ-induced-paired dominating graphs of paths and cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Signed total Roman domination in graphs
• Roman domination in graphs.
• Signed total Roman edge domination in graphs
• Signed Roman domination in graphs
• Weakly Connected Domination in Graphs
• Extremal Problems for Roman Domination
• Domination in Graphs Applied to Electric Power Networks
• SIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS
• The signed Roman domatic number of a digraph
• Signed Roman edge domination numbers in graphs

This page was built for publication: The signed Roman domination number of two classes graphs