Power domination problem in graphs
From MaRDI portal
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Programming involving graphs or networks (90C35)
Recommendations
Cited in
(40)- Power domination in circular-arc graphs
- Disproofs of three conjectures on the power domination of graphs
- Generalized power domination in claw-free regular graphs
- Hardness results of connected power domination for bipartite graphs and chordal graphs
- Power domination in the generalized Petersen graphs
- The k-power domination problem in weighted trees
- Power domination throttling
- Capacitated domination: problem complexity and approximation algorithms
- Power domination on permutation graphs
- Connected power domination in graphs
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}
- Power domination in graphs
- On the power domination number of graph products
- Disjoint sets in graphs and its application to electrical networks
- Algorithms and complexity of power domination in graphs
- Generalized power domination of graphs
- The power edge set problem
- Domination in Graphs Applied to Electric Power Networks
- Power domination in certain chemical structures
- Power domination number of sunlet graph and other graphs
- scientific article; zbMATH DE number 7493307 (Why is no real title available?)
- Power domination in Mycielskian of spiders
- Failed power domination on graphs
- Power domination in planar graphs with small diameter
- Fundamentals of Computation Theory
- Power domination with bounded time constraints
- \(k\)-power domination in block graphs
- New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts
- Labeling algorithm for power domination problem of trees
- 2-power domination number for Knödel graphs and its application in communication networks
- Exact and heuristic algorithms for the domination problem
- Hardness results of connected power domination for bipartite graphs and chordal graphs
- Connected power domination number of product graphs
- Restricted power domination and fault-tolerant power domination on grids
- On the power domination number of the generalized Petersen graphs
- Power domination in regular claw-free graphs
- Power domination on triangular grids with triangular and hexagonal shape
- On the \({k}\)-power domination of hypergraphs
- Improved algorithms and complexity results for power domination in graphs
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
This page was built for publication: Power domination problem in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717005)
