- Tytuł:
- Power Domination in the Generalized Petersen Graphs
- Autorzy:
-
Zhao, Min
Shan, Erfang
Kang, Liying - Powiązania:
- https://bibliotekanauki.pl/articles/31348324.pdf
- Data publikacji:
- 2020-08-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
power domination
domination
generalized Petersen graph
electric power system - Opis:
- The problem of monitoring an electric power system by placing as few measurement devices in the system can be formulated as a power dominating set problem in graph theory. The power domination number of a graph is the minimum cardinality of a power dominating set. Xu and Kang [On the power domination number of the generalized Petersen graphs, J. Comb. Optim. 22 (2011) 282–291] study the exact power domination number for the generalized Petersen graph P (3k, k), and propose the following problem: determine the power domination number for the generalized Petersen graph P (4k, k) or P (ck, k). In this paper we give the power domination number for P (4k, k) and present a sharp upper bound on the power domination number for the generalized Petersen graph P (ck, k).
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2020, 40, 3; 695-712
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł