| Author(s) |
Grigorious, Cyriac
Kalinowski, Thomas
Stephen, Sudeep
|
| Publication Date |
2018
|
| Abstract |
Let G=(V,A) be a directed graph, and let S⊆V be a set of vertices. Let the sequence S=S₀⊆S₁⊆S₂⊆⋯ be defined as follows: S₁ is obtained from S₀ by adding all out-neighbors of vertices in S₀. For k⩾2, Sₖ is obtained from Sₖ₋₁ by adding all vertices w such that for some vertex v∈Sₖ₋₁, w is the unique out-neighbor of v in V∖Sₖ₋₁. We set M(S)=S₀∪S₁∪⋯, and call S a power dominating set for G if M(S)=V(G). The minimum cardinality of such a set is called the power domination number of G. In this paper, we determine the power domination numbers of de Bruijn and Kautz digraphs.
|
| Citation |
Combinatorial Algorithms, v.10765, p. 264-272
|
| ISBN |
9783319788258
9783319788241
|
| Link | |
| Publisher |
Springer
|
| Series |
Lecture Notes in Computer Science
|
| Title |
On the Power Domination Number of de Bruijn and Kautz Digraphs
|
| Type of document |
Conference Publication
|
| Entity Type |
Publication
|
| Name | Size | format | Description | Link |
|---|