Domination in Graphs Applied to Electric Power Networks
From MaRDI portal
(Redirected from 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)- Domination problems on \(P_{5}\)-free graphs
- Zero forcing and power domination for graph products
- Zero forcing and maximum nullity for hypergraphs
- A note on power domination in grid graphs
- Approximating the minimum weight weak vertex cover
- On the size of immune sets in the k-PULL infection model
- Infectious power domination of hypergraphs
- A note on connected domination number and leaf number
- Exact and heuristic algorithms for the domination problem
- Zero forcing in iterated line digraphs
- Power domination in generalized undirected de Bruijn graphs and Kautz graphs
- Approximation algorithms for the total dominating set problem
- Power domination in circular-arc graphs
- scientific article; zbMATH DE number 5138348 (Why is no real title available?)
- Power domination in generalized Mycielskian of cycles
- The zero forcing polynomial of a graph
- On the power domination number of graph products
- A survey and classification of Sierpiński-type graphs
- Power domination in honeycomb networks
- On the zero forcing number of a graph involving some classical parameters
- Power domination in Knödel graphs and Hanoi graphs
- Generalized power domination: propagation radius and Sierpiński graphs
- The signed Roman domination number of two classes graphs
- Recent results on the power domination numbers of graph products
- Power domination in Mycielskian of spiders
- Connected power domination in graphs
- Power domination in cylinders, tori, and generalized Petersen graphs
- The probabilistic and reliable connected power dominating set problems
- New structures and their applications to variants of zero forcing and propagation time
- Exploring the influence of graph operations on zero forcing sets
- Generalized power domination in claw-free regular graphs
- Leaky forcing: a new variation of zero forcing
- Restricted power domination and fault-tolerant power domination on grids
- Grundy domination and zero forcing in regular graphs
- Power domination in the generalized Petersen graphs
- Failed power domination on graphs
- Linear-time algorithm for paired-domination on distance-hereditary graphs
- An efficient algorithm for power dominating set
- Some product graphs with power dominating number at most 2
- Power domination number of sunlet graph and other graphs
- The relationship between \(k\)-forcing and \(k\)-power domination
- Improved Computational Approaches and Heuristics for Zero Forcing
- Algorithms and applications for a class of bilevel MILPs
- The zero forcing number of graphs with the matching number and the cyclomatic number
- Total forcing versus total domination in cubic graphs
- k-rainbow domatic numbers
- Algorithms and complexity of power domination in graphs
- Computing and Combinatorics
- Nordhaus-Gaddum problems for power domination
- Propagating sets in Sierpiński fractal graphs
- The edge-vertex domination and weighted edge-vertex domination problem
- On leaky forcing and resilience
- The k edge-vertex domination problem
- On the power domination number of the generalized Petersen graphs
- On the power domination number of the Cartesian product of graphs
- Resolving-power dominating sets
- Capacitated domination: problem complexity and approximation algorithms
- Power domination with random sensor failure
- Zero forcing versus domination in cubic graphs
- Generalized power domination of graphs
- Power domination in certain chemical structures
- The complexity of finding harmless individuals in social networks
- Bounds on zero forcing using (upper) total domination and minimum degree
- The \(k\)-power bondage number of a graph
- Total forcing sets and zero forcing sets in trees
- Complexity and lowers bounds for power edge set problem
- Power dominator chromatic numbers of splitting graphs of certain classes of graphs
- scientific article; zbMATH DE number 7666852 (Why is no real title available?)
- Complexity and inapproximability results for the power edge set problem
- Zero forcing in claw-free cubic graphs
- Hybrid search for the optimal PMU placement problem on a power grid
- Power domination in generalized Mycielskian of spiders
- On trees and unicyclic graphs with equal forcing-type numbers
- Minimum rank and zero forcing number for butterfly networks
- 2-power domination number for Knödel graphs and its application in communication networks
- New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts
- On the \({k}\)-power domination of hypergraphs
- On the zero forcing number of trees
- Hardness results of connected power domination for bipartite graphs and chordal graphs
- Graphs with total forcing number two, revisited
- Power domination of the Cartesian product of graphs
- Approximating the minimum rank of a graph via alternating projection
- On a conjecture for power domination
- Computational approaches for zero forcing and related problems
- Parameterized power domination complexity
- Power domination in planar graphs with small diameter
- Throttling processes equivalent to full throttling on trees
- Average distance and connected domination
- Improved algorithms and complexity results for power domination in graphs
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- Connected power domination number of product graphs
- On minimal geodetic domination in graphs
- k-fault tolerant power domination number for block graphs
- The k-power domination problem in weighted trees
- Connected \(dr\)-power dominating sets in graphs
- On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs
- The zero forcing number of claw-free cubic graphs
- The zero forcing numbers of peony graphs and web graphs
- An upper bound for the k-power domination number in r-uniform hypergraphs
- Power domination in cubic graphs and Cartesian products
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)
