Global triple Roman dominating function
A triple Roman dominating function (TRD-function) of a graph \(G\) is a function \(f: V(G) \rightarrow \{0, 1, 2, 3, 4\}\) such that if \(f(v) < 3\), then \(f(AN[v]) \ge |AN(v)| + 3\), where \(AN(v)\) is the set of neighbors of \(v\) assigned a non-zero value under \(f\). The minimum weight of a TRD-function on \(G\) is the triple Roman domination number of \(G\), denoted by \(\gamma_{[3R]}(G)\). A global triple Roman dominating function is a TRD-function for both \(G\) and its complement; the global triple Roman domination number is denoted by \(\gamma_{g[3R]}(G)\). It is proved that the global triple Roman dominating problem is NP-complete for bipartite and chordal graphs. Numerous bounds on \(\gamma_{[3R]}(G)\) and \(\gamma_{g[3R]}(G)\) are given and relations between them studied. For instance, if the diameter of \(G\) is at least \(6\) or its radius is \(4\) or \(5\), then \(\gamma_{[3R]}(G) = \gamma_{g[3R]}(G)\), while if \(G\) is triangle-free, then \(\gamma_{g[3R]}(G) \le \gamma_{[3R]}(G) + 4\).
- Algorithmic aspects of certified domination in graphs
- Double Roman domination
- Fractional global domination in graphs
- Global rainbow domination in graphs
- Global Roman domination in trees
- scientific article; zbMATH DE number 4204392 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 6424505 (Why is no real title available?)
- scientific article; zbMATH DE number 7276884 (Why is no real title available?)
- scientific article; zbMATH DE number 6769213 (Why is no real title available?)
- On roman, global and restrained domination in graphs
- On the global Roman domination number in graphs
- Roman domination in graphs.
- The total global domination number of a graph
- Total Roman reinforcement in graphs
- Triple Roman domination in graphs
- Global total Roman domination in graphs
- Triple Roman domination subdivision number in graphs
- On [k]-Roman domination subdivision number of graphs
- An upper bound on triple Roman domination
- Algorithmic complexity of triple Roman dominating functions on graphs
- The triple Roman domination stability in graphs
- Some results on the global triple Roman domination in graphs
This page was built for publication: Global triple Roman dominating function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127628)