@inproceedings{41033322cc05406b812941fc11abf54d,
title = "On the Power Domination Number of de Bruijn and Kautz Digraphs",
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.",
keywords = "Combinatorics and Discrete Mathematics (excl. Physical Combinatorics)",
author = "Cyriac Grigorious and Thomas Kalinowski and Sudeep Stephen",
year = "2018",
doi = "10.1007/978-3-319-78825-8\_22",
language = "English",
isbn = "9783319788258",
volume = "10765",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "264--272",
editor = "Ljiljana Brankovic and Joe Ryan and \{F Smyth\}, William",
booktitle = "Combinatorial Algorithms",
note = "IWOCA 2017: 28th International Workshop on Combinatorial Algorithms ; Conference date: 17-07-2017 Through 21-07-2017",
}