Signed total Roman domination in graphs
From MaRDI portal
Publication:326484
DOI10.1007/S10878-015-9906-6zbMath1348.05159OpenAlexW413798046MaRDI QIDQ326484
Publication date: 12 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-9906-6
total domination numbertotal dominating setsigned total Roman dominating functionsigned total Roman domination number
Related Items (21)
Twin signed total Roman domatic numbers in digraphs ⋮ Nonnegative signed total Roman domination in graphs ⋮ Signed total Italian k-domination in graphs ⋮ Complexity of signed total \(k\)-Roman domination problem in graphs ⋮ On the signed total Roman domination and domatic numbers of graphs ⋮ On trees with equal Roman domination and outer-independent Roman domination numbers ⋮ The Roman domatic problem in graphs and digraphs: a survey ⋮ Twin signed total Roman domination numbers in digraphs ⋮ Graphs with diameter 2 and large total domination number ⋮ The signed total Roman \(k\)-domatic number of a graph ⋮ Signed total Roman edge domination in graphs ⋮ Bounds on the domination number of a digraph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Signed double Roman domination in graphs ⋮ The signed total Roman domatic number of a digraph ⋮ Varieties of Roman domination II ⋮ The signed Roman domination number of two classes graphs ⋮ Bounds on the signed total Roman 2-domination in graphs ⋮ Weak signed Roman domination in graphs ⋮ Weak Signed Roman Domination in Digraphs
Cites Work
This page was built for publication: Signed total Roman domination in graphs
