scientific article; zbMATH DE number 7392978
From MaRDI portal
Publication:4957549
DOI10.22049/cco.2020.26928.1166zbMath1488.05362MaRDI QIDQ4957549
Farzaneh Azvin, Lutz Volkmann, Rad Nader Jafari
Publication date: 9 September 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (18)
Outer independent Roman domination number of trees ⋮ On the Italian reinforcement number of a digraph ⋮ On the outer-independent double Italian domination number ⋮ Lower and upper bounds on independent double Roman domination in trees ⋮ Total double Roman domination numbers in digraphs ⋮ Outer independent double Italian domination: Complexity, characterization ⋮ Restrained Italian reinforcement number in graphs ⋮ Perfect double Italian domination of a graph ⋮ Restrained Italian bondage number in graphs ⋮ Hardness and approximation results of Roman \{3\}-domination in graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Efficient algorithms for independent Roman domination on some classes of graphs ⋮ Total Roman \(\{2\}\)-reinforcement of graphs ⋮ Remarks on the outer-independent double Italian domination number ⋮ Double Roman reinforcement number in graphs ⋮ Quadruple Roman domination in graphs ⋮ Double Roman domination subdivision number in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roman \(\{2 \}\)-domination
- Double Roman domination
- Italian domination in trees
- On graphs having domination number half their order
- Roman domination in graphs.
- Bounds on the double Italian domination number of a graph
- Roman \(\{ 3 \}\)-domination (double Italian domination)
- On algorithmic complexity of double Roman domination
- Outer independent double Roman domination
- Outer independent Roman dominating functions in graphs
- Domination-balanced graphs
- Double Roman domination and domatic numbers of graphs
- Topics in Domination in Graphs
- Total double Roman domination in graphs
This page was built for publication:
