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

DOI10.1007/s10878-016-0103-zzbMath1376.05110arXiv1512.06413OpenAlexW2566059864MaRDI QIDQ1680484

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

zbMATH Keywords

power dominationtime constraintpropagation timepower propagation time

Mathematics Subject Classification ID

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

Related Items (10)

Restricted power domination and zero forcing problems ⋮ Minimum rank and zero forcing number for butterfly networks ⋮ Connected power domination in graphs ⋮ Unnamed Item ⋮ Power Domination Parameters in Honeycomb-Like Networks ⋮ Failed power domination on graphs ⋮ Unnamed Item ⋮ Power Domination in Graphs ⋮ Product throttling ⋮ Power domination throttling

Cites Work

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

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