Domination in Graphs Applied to Electric Power Networks
From MaRDI portal
Publication:4785698
Recommendations
- Power domination in graphs
- Power domination in graphs
- Connected power domination in graphs
- Computing and Combinatorics
- Graph theory applications to deregulated power systems
- Power network dynamics on graphons
- Power domination in block graphs
- Generalized power domination of graphs
- Generalized power domination in regular graphs
- A note on power domination in grid graphs
Cited in
(only showing first 100 items - show all)- Generalized power domination of graphs
- The complexity of finding harmless individuals in social networks
- On the power domination number of the Cartesian product of graphs
- Connected power domination in graphs
- On the total forcing number of a graph
- On the power domination number of graph products
- scientific article; zbMATH DE number 5138348 (Why is no real title available?)
- Complexity and computation of connected zero forcing
- On the \({k}\)-power domination of hypergraphs
- Average distance and connected domination
- Power domination in block graphs
- Power domination in regular claw-free graphs
- The \(k\)-power bondage number of a graph
- Minimum power dominating sets of random cubic graphs
- A note on power domination in grid graphs
- Nordhaus-Gaddum problems for power domination
- \(k\)-rainbow domatic numbers
- Computational approaches for zero forcing and related problems
- On 2-rainbow domination of generalized Petersen graphs
- Improved algorithms and complexity results for power domination in graphs
- Power domination on triangular grids with triangular and hexagonal shape
- Power domination in graphs
- Observability of power systems with optimal PMU placement
- On the power domination number of the generalized Petersen graphs
- On minimal geodetic domination in graphs
- Power domination in certain chemical structures
- Complexity and lowers bounds for power edge set problem
- Linear-time algorithm for paired-domination on distance-hereditary graphs
- Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees
- \(k\)-power domination in block graphs
- Bounds on the connected forcing number of a graph
- Recent results on the power domination numbers of graph products
- Parameterized power domination complexity
- Solving the connected dominating set problem and power dominating set problem by integer programming
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- Power domination with bounded time constraints
- Note on power propagation time and lower bounds for the power domination number
- Zero forcing and power domination for graph products
- Power domination in Knödel graphs and Hanoi graphs
- Grundy dominating sequences and zero forcing sets
- Infectious power domination of hypergraphs
- Generalized power domination: propagation radius and Sierpiński graphs
- Experiments on data reduction for optimal domination in networks
- Power domination in circular-arc graphs
- Computational study on planar dominating set problem
- Solving the multistage PMU placement problem by integer programming and equivalent network design model
- An iterated greedy algorithm for finding the minimum dominating set in graphs
- A survey and classification of Sierpiński-type graphs
- Immune sets in monotone infection rules. Characterization and complexity
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}
- Power domination in planar graphs with small diameter
- Complexity and inapproximability results for the power edge set problem
- Hybrid search for the optimal PMU placement problem on a power grid
- Approximating the minimum weight weak vertex cover
- Power domination of the Cartesian product of graphs
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size
- Restricted power domination and fault-tolerant power domination on grids
- Disproofs of three conjectures on the power domination of graphs
- Computing and Combinatorics
- Restricted power domination and zero forcing problems
- Power domination in honeycomb networks
- Resolving-power dominating sets
- Power domination in cylinders, tori, and generalized Petersen graphs
- Hardness results of connected power domination for bipartite graphs and chordal graphs
- The \(k\) edge-vertex domination problem
- Minimum rank and zero forcing number for butterfly networks
- Connected \(dr\)-power dominating sets in graphs
- Note on forcing problem of trees
- The zero forcing polynomial of a graph
- Zero forcing in benzenoid network
- The zero forcing number of graphs with the matching number and the cyclomatic number
- 2-power domination number for Knödel graphs and its application in communication networks
- On a conjecture for power domination
- Improved Computational Approaches and Heuristics for Zero Forcing
- Power domination parameters in honeycomb-like networks
- Exact and heuristic algorithms for the domination problem
- Hardness results of connected power domination for bipartite graphs and chordal graphs
- New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts
- Generalized power domination in claw-free regular graphs
- Total forcing sets and zero forcing sets in trees
- Throttling processes equivalent to full throttling on trees
- Failed power domination on graphs
- Zero forcing in triangulations
- Zero forcing and maximum nullity for hypergraphs
- Power domination in tree derived architectures
- The signed Roman domination number of two classes graphs
- Disjoint sets in graphs and its application to electrical networks
- Complexity of domination in triangulated plane graphs
- Power domination in Mycielskians of n -spiders
- The probabilistic and reliable connected power dominating set problems
- Minimal zero forcing sets
- Failed power domination in grids, cylinders, and tori
- Zero forcing in iterated line digraphs
- On the zero forcing number of a graph involving some classical parameters
- A zero forcing technique for bounding sums of eigenvalue multiplicities
- Domination problems on \(P_{5}\)-free graphs
- The \(k\)-power domination problem in weighted trees
- Zero forcing versus domination in cubic graphs
- Grundy domination and zero forcing in regular graphs
- The \(k\)-power domination problem in weighted trees
This page was built for publication: Domination in Graphs Applied to Electric Power Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785698)
