Generalized power domination in WK-pyramid networks

zbMATH Open1368.05115arXiv1508.00357MaRDI QIDQ2961027FDOQ2961027

A. Vijayakumar, Seethu Varghese

Publication date: 17 February 2017

Abstract: The notion of power domination arises in the context of monitoring an electric power system with as few phase measurement units as possible. The $k-$power domination number of a graph $G$ is the minimum cardinality of a $k-$power dominating set ($k-$PDS) of $G$. In this paper, we determine the $k-$power domination number of WK-Pyramid networks, $WK{P}_{(C,L)}$, for all positive values of $k$ except for $k=C-1,Cgeq2$, for which we give an upper bound. The $k-$propagation radius of a graph $G$ is the minimum number of propagation steps needed to monitor the graph $G$ over all minimum $k-$PDS. We obtain the $k-$propagation radius of $WK{P}_{(C,L)}$ in some cases.

Full work available at URL: https://arxiv.org/abs/1508.00357

Recommendations

• Power domination in Knödel graphs and Hanoi graphs
• Generalized power domination: propagation radius and Sierpiński graphs
• Power domination parameters in honeycomb-like networks
• Power domination on triangular grids with triangular and hexagonal shape
• Power domination in the generalized Petersen graphs

zbMATH Keywords

dominationpower dominationelectrical network monitoringWK-pyramid network

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Applications of graph theory to circuits and networks (94C15)

Cited In (3)

• Power domination in honeycomb networks
• Title not available (Why is that?)
• Power Domination in Graphs

This page was built for publication: Generalized power domination in WK-pyramid networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961027)