Domination in Graphs Applied to Electric Power Networks

DOI10.1137/S0895480100375831zbMATH Open1006.05043OpenAlexW2023728975MaRDI QIDQ4785698FDOQ4785698

Authors: Teresa W. Haynes, Sandra M. Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning 

Publication date: 5 January 2003

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480100375831

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

zbMATH Keywords

power dominationelectric power monitoring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (only showing first 100 items - show all)

• A note on power domination in grid graphs
• Infectious power domination of hypergraphs
• Approximating the minimum weight weak vertex cover
• The k-power bondage number of a graph
• Zero forcing in iterated line digraphs
• Power domination in circular-arc graphs
• Title not available (Why is that?)
• Power domination in honeycomb networks
• The zero forcing polynomial of a graph
• Power domination in Knödel graphs and Hanoi graphs
• Generalized power domination: propagation radius and Sierpiński graphs
• A survey and classification of Sierpiński-type graphs
• Power domination in cylinders, tori, and generalized Petersen graphs
• Connected power domination in graphs
• Linear-time algorithm for paired-domination on distance-hereditary graphs
• Restricted power domination and fault-tolerant power domination on grids
• Computing and Combinatorics
• \(k\)-rainbow domatic numbers
• Nordhaus-Gaddum problems for power domination
• On the power domination number of the Cartesian product of graphs
• On the power domination number of the generalized Petersen graphs
• Observing the State of a Smart Grid Using Bilevel Programming
• Resolving-power dominating sets
• On the Power Domination Number of Graph Products
• Generalized power domination of graphs
• The complexity of finding harmless individuals in social networks
• Power domination in certain chemical structures
• Complexity and lowers bounds for power edge set problem
• Complexity and inapproximability results for the power edge set problem
• Hybrid search for the optimal PMU placement problem on a power grid
• On the \({k}\)-power domination of hypergraphs
• Minimum Power Dominating Sets of Random Cubic Graphs
• Power domination of the Cartesian product of graphs
• Power domination in planar graphs with small diameter
• Average distance and connected domination
• Computational approaches for zero forcing and related problems
• Parameterized power domination complexity
• Improved algorithms and complexity results for power domination in graphs
• On minimal geodetic domination in graphs
• Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
• Title not available (Why is that?)
• An iterated greedy algorithm for finding the minimum dominating set in graphs
• Experiments on data reduction for optimal domination in networks
• Complexity and computation of connected zero forcing
• Computational study on planar dominating set problem
• The forcing number of graphs with given girth
• Power domination in regular claw-free graphs
• \(k\)-power domination in block graphs
• Note on power propagation time and lower bounds for the power domination number
• Restricted power domination and zero forcing problems
• Observability of power systems with optimal PMU placement
• Title not available (Why is that?)
• Power domination on triangular grids with triangular and hexagonal shape
• Power domination with bounded time constraints
• Immune sets in monotone infection rules. Characterization and complexity
• On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size
• Grundy dominating sequences and zero forcing sets
• Power domination in block graphs
• Disproofs of three conjectures on the power domination of graphs
• 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
• Bounds on the connected forcing number of a graph
• 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 in graphs
• Exact and heuristic algorithms for the domination problem
• Zero forcing and maximum nullity for hypergraphs
• A note on connected domination number and leaf number
• Power domination in generalized undirected de Bruijn graphs and Kautz graphs
• GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED
• The signed Roman domination number of two classes graphs
• On the zero forcing number of a graph involving some classical parameters
• Power domination in Mycielskian of spiders
• The probabilistic and reliable connected power dominating set problems
• CONNECTED dr-POWER DOMINATING SETS IN GRAPHS
• Generalized power domination in claw-free regular graphs
• Failed power domination on graphs
• Grundy domination and zero forcing in regular graphs
• Some product graphs with power dominating number at most 2
• Power domination in the generalized Petersen graphs
• Power domination number of sunlet graph and other graphs
• The zero forcing number of graphs with the matching number and the cyclomatic number
• Improved Computational Approaches and Heuristics for Zero Forcing
• Algorithms and applications for a class of bilevel MILPs
• The relationship between \(k\)-forcing and \(k\)-power domination
• Total forcing versus total domination in cubic graphs
• Power Domination Parameters in Honeycomb-Like Networks
• The \(k\) edge-vertex domination problem
• On leaky forcing and resilience
• Capacitated domination: problem complexity and approximation algorithms
• Zero forcing versus domination in cubic graphs
• Bounds on zero forcing using (upper) total domination and minimum degree
• Title not available (Why is that?)
• Total forcing sets and zero forcing sets in trees
• Zero forcing in claw-free cubic graphs
• 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

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)