Year: 2022
Type: preprint
Abstract: Motivated by the question of computing the probability of successful power domination by placing k monitors uniformly at random, in this paper we give a recursive formula to count the number of power domination sets of size k in a labeled complete m-ary tree. As a corollary we show that the desired probability can be computed in exponential with linear exponent time.
Source: arXiv (Cornell University)
Authors: Kniahnitskaya, Sviatlana, Ortiz, Michele, Ramirez, Olivia, Shultis, Katharine, Whitlatch, Hays
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4226113604