There are many examples for the fact that the growth of a system is limited if this system relies on important central instances for supply or control. In a growing system, the central instances turn into bottlenecks, thus making the system inefficient. Examples for this phenomenon can be found in computer science, in history, and even in the behavior of dinosaurs. Distributed systems have grea...

There are many examples for the fact that the growth of a system is limited if this system relies on important central instances for supply or control. In a growing system, the central instances turn into bottlenecks, thus making the system inefficient. Examples for this phenomenon can be found in computer science, in history, and even in the behavior of dinosaurs. Distributed systems have grea...

For a graph G = (V,E), a Roman dominating function on G is a function f : V (G) → {0, 1, 2} such that every vertex u for which f(u) = 0 is adjacent to at least one vertex v with f(v) = 2. The weight of a Roman dominating function is the value f(V (G)) = ∑ u∈V (G) f(u). The minimum weight of a Roman dominating function on a graph G is called the Roman domination number of G, denoted by γR (G). T...