Total Roman \2\-reinforcement of graphs
Summary: A total Roman \(\{2\}\)-dominating function (TR2DF) on a graph \(\Gamma=(V,E)\) is a function \(l:V\longrightarrow\{0,1,2\}\), satisfying the conditions that (i) for every vertex \(y\in V\) with \(l(y)=0\), either \(y\) is adjacent to a vertex labeled 2 under \(l\), or \(y\) is adjacent to at least two vertices labeled 1; (ii) the subgraph induced by the set of vertices with positive weight has no isolated vertex. The weight of a TR2DF \(l\) is the value \(\sum_{y\in V} l (y)\). The total Roman \(\{2\}\)-domination number (TR2D-number) of a graph \(\Gamma\) is the minimum weight of a TR2DF on \(\Gamma\). The total Roman \(\{2\}\)-reinforcement number (TR2R-number) of a graph is the minimum number of edges that have to be added to the graph in order to decrease the TR2D-number. In this manuscript, we study the properties of TR2R-number and we present some sharp upper bounds. In particular, we determine the exact value of TR2R-numbers of some classes of graphs.
- Total Roman reinforcement in graphs
- Quasi-total Roman reinforcement in graphs
- Total Roman \(\{2\}\)-domination in graphs
- Roman reinforcement in graphs
- Total Roman \(\{2\}\)-dominating functions in graphs
- The Roman \(\{2 \}\)-domatic number of graphs
- On the Roman \(\{2\}\)-domatic number of graphs
- Further progress on the total Roman \(\{2\}\)-domination number of graphs
- On total Roman domination in graphs
- Roman \(\{2\}\)-domination problem in graphs
- Bounds on the outer-independent double Italian domination number
- Graphs with large Italian domination number
- Independent Roman \(\{2 \}\)-domination in graphs
- Italian domination in digraphs
- Italian domination in trees
- Outer independent double Roman domination
- Perfect Italian domination in trees
- Roman \(\{2 \}\)-domination
- The Italian domatic number of a digraph
- Total domination in graphs
- Total reinforcement number of a graph
- Total Roman reinforcement in graphs
- Triple Roman domination in graphs
- Varieties of Roman Domination
- Varieties of Roman domination. II
- Total Roman \(\{2\}\)-dominating functions in graphs
- Total Roman reinforcement in graphs
- Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties
- Quasi-total Roman reinforcement in graphs
- Algorithmic aspect on total Roman \(\{2\}\)-domination of Cartesian products of paths and cycles
- An upper bound on the total Roman \(\{2\}\)-domination number of graphs with minimum degree two
This page was built for publication: Total Roman \(\{2\}\)-reinforcement of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2035667)
