Note on power propagation time and lower bounds for the power domination number

DOI10.1007/S10878-016-0103-ZMaRDI QIDQ1680484zbMATH OpenOpenAlexFDO

Authors Peng Zhang

Publication date 16 November 2017

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1512.06413, https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1059&context=math_pubs

zbMATH Keywords

power dominationpropagation timetime constraintpower propagation time

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Applications of graph theory to circuits and networks (94C15)

Abstract: We present a counterexample to a lower bound for the power domination number given in Liao, Power domination with bounded time constraints, J. Comb. Optim. 31 (2016)725-742. We also define the power propagation time, using the power domination propagation ideas in Liao and the (zero forcing) propagation time in Hogben et al, Propagation time for zero forcing on a graph, Discrete Appl. Math.160 (2012) 1994-2005.

Recommendations

• Power domination with bounded time constraints
• Power domination in graphs
• Power domination in graphs
• On a conjecture for power domination
• Power domination throttling

Cites work

• Domination in Graphs Applied to Electric Power Networks
• Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
• Improved algorithms and complexity results for power domination in graphs
• Power domination with bounded time constraints
• Propagation time for zero forcing on a graph
• The PMU Placement Problem
• Zero forcing and power domination for graph products
• Zero forcing sets and the minimum rank of graphs

Cited in

(10)

• Minimum rank and zero forcing number for butterfly networks
• Connected power domination in graphs
• Power domination parameters in honeycomb-like networks
• Failed power domination on graphs
• Zero forcing and power domination for graph products
• Product throttling
• scientific article; zbMATH DE number 7666852 (Why is no real title available?)
• Restricted power domination and zero forcing problems
• Power domination throttling
• Power domination in graphs

This page was built for publication: Note on power propagation time and lower bounds for the power domination number

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