Power domination throttling
| Autor: | Brimkov, Boris, Carlson, Joshua, Hicks, Illya V., Patel, Rutvik, Smith, Logan |
|---|---|
| Rok vydání: | 2018 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | A power dominating set of a graph $G=(V,E)$ is a set $S\subset V$ that colors every vertex of $G$ according to the following rules: in the first timestep, every vertex in $N[S]$ becomes colored; in each subsequent timestep, every vertex which is the only non-colored neighbor of some colored vertex becomes colored. The power domination throttling number of $G$ is the minimum sum of the size of a power dominating set $S$ and the number of timesteps it takes $S$ to color the graph. In this paper, we determine the complexity of power domination throttling and give some tools for computing and bounding the power domination throttling number. Some of our results apply to very general variants of throttling and to other aspects of power domination. Comment: 19 pages |
| Databáze: | arXiv |
| Externí odkaz: |
|