Failed power domination on graphs

zbMath1439.05178arXiv1909.02057MaRDI QIDQ5109066

Abraham Glasser, Emily Lederman, Stanislaw P. Radziszowski, Bonnie C. Jacob

Publication date: 7 May 2020

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

zbMATH Keywords

power domination numberpower dominating set

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Failed power domination in grids, cylinders, and tori

Cites Work

• Failed skew zero forcing on a graph
• On the graph complement conjecture for minimum rank
• A technique for computing the zero forcing number of a graph with a cut-vertex
• On the complexity of failed zero forcing
• Parameterized power domination complexity
• Minimum rank problems
• Zero forcing parameters and minimum rank problems
• Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
• An upper bound on the domination number of a graph with minimum degree 2
• On the power domination number of de Bruijn and Kautz digraphs
• Note on power propagation time and lower bounds for the power domination number
• The failed zero forcing number of a graph
• Zero forcing sets and the minimum rank of graphs
• Domination in Graphs Applied to Electric Power Networks
• The PMU Placement Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Failed power domination on graphs