Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference12 articles.
1. Benson, K.F., Ferrero, D., Flagg, M., Furst, V., Hogben, L., Vasilevska, V.: Nordhaus–Gaddum problems for power domination. Discrete Appl. Math. 251, 103–113 (2018)
2. Benson, K.F., Ferrero, D., Flagg, M., Furst, V., Hogben, L., Vasilevska, V., Wissman, B.: Zero forcing and power domination for graph products. Australas. J. Combin. 70, 221–235 (2018)
3. Bozeman, C., Brimkov, B., Erickson, C., Ferrero, D., Flagg, M., Hogben, L.: Restricted powerdomination and zero forcing problems. J. Combin. Optim. 37, 935–95 (2019)
4. Brueni, D.J., Heath, L.S.: The PMU placement problem. SIAM J. Discrete Math. 19, 744–761 (2005)
5. Dorbec, P., Mollard, M., Klavžar, S., Špacapan, S.: Power domination in product graphs. SIAM J. Discrete Math. 22, 554–567 (2008)