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)- The \(k\)-power domination problem in weighted trees
- Experiments on data reduction for optimal domination in networks
- Hardness results of connected power domination for bipartite graphs and chordal graphs
- Failed power domination in grids, cylinders, and tori
- Complexity and computation of connected zero forcing
- An iterated greedy algorithm for finding the minimum dominating set in graphs
- Computational study on planar dominating set problem
- Power domination in regular claw-free graphs
- Some properties of the closed global shadow graphs and their zero forcing number
- Note on forcing problem of trees
- The forcing number of graphs with given girth
- Parameterized algorithms for power edge set and zero forcing set
- Note on power propagation time and lower bounds for the power domination number
- Restricted power domination and zero forcing problems
- Power domination in Mycielskians of n -spiders
- Minimal zero forcing sets
- \(k\)-power domination in block graphs
- Power domination in graphs
- Observability of power systems with optimal PMU placement
- Complexity of domination in triangulated plane graphs
- The restrained double Roman domination in graphs
- Power domination in tree derived architectures
- Power domination on triangular grids with triangular and hexagonal shape
- Unique continuation principles for finite-element discretizations of the Laplacian
- Multiparent path relinking. An application to the power dominating set problem
- Labeling algorithm for power domination problem of trees
- Power domination with bounded time constraints
- Zero forcing in triangulations
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size
- Product throttling
- Immune sets in monotone infection rules. Characterization and complexity
- Grundy dominating sequences and zero forcing sets
- Solving the connected dominating set problem and power dominating set problem by integer programming
- Domination and power domination numbers of dendrimers: chemical significance of domination variants through QSPR analysis
- Power domination in block graphs
- Zero forcing in benzenoid network
- Power domination on permutation graphs
- Disproofs of three conjectures on the power domination of graphs
- Minimum power dominating sets of random cubic graphs
- Power domination throttling
- On the total forcing number of a graph
- On 2-rainbow domination of generalized Petersen graphs
- Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees
- scientific article; zbMATH DE number 7493307 (Why is no real title available?)
- Vertex sequences in graphs
- Certified domination critical graphs upon vertex removal
- Bounds on the connected forcing number of a graph
- Disjoint sets in graphs and its application to electrical networks
- Solving the multistage PMU placement problem by integer programming and equivalent network design model
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}
- Power domination parameters in honeycomb-like networks
- A zero forcing technique for bounding sums of eigenvalue multiplicities
- Power domination in graphs
- Observing the state of a smart grid using bilevel programming
- Heuristics for the weighted total domination problem
- Edge forcing in butterfly networks
- 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
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)
