Power domination in graphs
From MaRDI portal
Publication:2502911
DOI10.1016/j.disc.2006.03.037zbMath1099.05065OpenAlexW1968626979MaRDI QIDQ2502911
Min Zhao, Gerard Jennhwa Chang, Li-ying Kang
Publication date: 13 September 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.037
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (60)
On the zero forcing number and spectral radius of graphs ⋮ Power domination number of sunlet graph and other graphs ⋮ Nordhaus-Gaddum problems for power domination ⋮ Computational approaches for zero forcing and related problems ⋮ The k-power bondage number of a graph ⋮ k-Forcing number for Cartesian product of some graphs ⋮ Hybrid search for the optimal PMU placement problem on a power grid ⋮ On trees and unicyclic graphs with equal forcing-type numbers ⋮ Power domination in cubic graphs and Cartesian products ⋮ Throttling processes equivalent to full throttling on trees ⋮ Power domination in the generalized Petersen graphs ⋮ On the \({k}\)-power domination of hypergraphs ⋮ Power domination in Mycielskian of spiders ⋮ Extremal \(k\)-forcing sets in oriented graphs ⋮ Some properties of the closed global shadow graphs and their zero forcing number ⋮ Power domination in Knödel graphs and Hanoi graphs ⋮ Restricted power domination and zero forcing problems ⋮ Power domination in circular-arc graphs ⋮ 2-power domination number for Knödel graphs and its application in communication networks ⋮ Bounding the total forcing number of graphs ⋮ Zero forcing with random sets ⋮ A cutting-plane algorithm for solving a weighted influence interdiction problem ⋮ Generalized power domination of graphs ⋮ Unnamed Item ⋮ Probabilistic zero forcing on random graphs ⋮ On the total forcing number of a graph ⋮ Upper bounds on the \(k\)-forcing number of a graph ⋮ The zero forcing polynomial of a graph ⋮ Power domination in certain chemical structures ⋮ The forcing number of graphs with given girth ⋮ Power domination in honeycomb networks ⋮ Bounds on the connected forcing number of a graph ⋮ Generalized power domination: propagation radius and Sierpiński graphs ⋮ Total forcing versus total domination in cubic graphs ⋮ Complexity and computation of connected zero forcing ⋮ Restricted power domination and fault-tolerant power domination on grids ⋮ Power domination in planar graphs with small diameter ⋮ Domination in graphs with bounded propagation: Algorithms, formulations and hardness results ⋮ On the power domination number of the generalized Petersen graphs ⋮ Zero forcing versus domination in cubic graphs ⋮ Power domination in block graphs ⋮ Approximating the minimum rank of a graph via alternating projection ⋮ On the Power Domination Number of Graph Products ⋮ Infectious power domination of hypergraphs ⋮ Power domination with bounded time constraints ⋮ On a conjecture for power domination ⋮ Zero forcing in claw-free cubic graphs ⋮ Algorithms and Complexity of Power Domination in Graphs ⋮ Power Domination in Graphs ⋮ Disproofs of three conjectures on the power domination of graphs ⋮ Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees ⋮ Tight bounds on probabilistic zero forcing on hypercubes and grids ⋮ Power domination in regular claw-free graphs ⋮ Power domination in cylinders, tori, and generalized Petersen graphs ⋮ Power domination on triangular grids with triangular and hexagonal shape ⋮ Power domination throttling ⋮ Efficient and non-efficient domination of \(\mathbb{Z}\)-stacked Archimedean lattices ⋮ Some product graphs with power dominating number at most 2 ⋮ Minimum Power Dominating Sets of Random Cubic Graphs ⋮ Generalized power domination in claw-free regular graphs
Cites Work
This page was built for publication: Power domination in graphs
