Domination in Graphs Applied to Electric Power Networks
From MaRDI portal
Publication:4785698
DOI10.1137/S0895480100375831zbMath1006.05043MaRDI QIDQ4785698
Michael A. Henning, Stephen T. Hedetniemi, Sandra M. Hedetniemi, Teresa W. Haynes
Publication date: 5 January 2003
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Unnamed Item, The forcing number of graphs with given girth, Power domination in honeycomb networks, CONNECTED dr-POWER DOMINATING SETS IN GRAPHS, Failed power domination on graphs, Unnamed Item, Power domination in generalized undirected de Bruijn graphs and Kautz graphs, Domination problems on P5-free graphs, Minimum Power Dominating Sets of Random Cubic Graphs, The k-power bondage number of a graph, Power domination in planar graphs with small diameter, Power domination with bounded time constraints, \(k\)-power domination in block graphs, Resolving-power dominating sets, Hybrid search for the optimal PMU placement problem on a power grid, Power domination of the Cartesian product of graphs, \(k\)-rainbow domatic numbers, Generalized power domination of graphs, Power domination in certain chemical structures, On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size, A survey and classification of Sierpiński-type 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, Parameterized power domination complexity, Approximating the minimum weight weak vertex cover, Experiments on data reduction for optimal domination in networks, 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, Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees, Computational study on planar dominating set problem, Nordhaus-Gaddum problems for power domination, Computational approaches for zero forcing and related problems, Observability of power systems with optimal PMU placement, Note on power propagation time and lower bounds for the power domination number, Power domination in Knödel graphs and Hanoi graphs, Complexity and lowers bounds for power edge set problem, Zero forcing in iterated line digraphs, On the total forcing number of a graph, On 2-rainbow domination of generalized Petersen graphs, The zero forcing polynomial of a graph, Complexity and inapproximability results for the power edge set problem, The relationship between \(k\)-forcing and \(k\)-power domination, Grundy dominating sequences and zero forcing sets, Bounds on the connected forcing number of a graph, Approximating the minimum rank of a graph via alternating projection, Power domination in circular-arc graphs, Total forcing versus total domination in cubic graphs, Complexity and computation of connected zero forcing, Power domination in the generalized Petersen graphs, Total forcing sets and zero forcing sets in trees, On the power domination number of the Cartesian product of graphs, Complexity of domination in triangulated plane graphs, Zero forcing and maximum nullity for hypergraphs, Generalized power domination: propagation radius and Sierpiński graphs, Algorithms and applications for a class of bilevel MILPs, Infectious power domination of hypergraphs, The \(k\)-power domination problem in weighted trees, On the zero forcing number of a graph involving some classical parameters, Zero forcing in claw-free cubic graphs, The probabilistic and reliable connected power dominating set problems, Power domination throttling, The complexity of finding harmless individuals in social networks, Capacitated domination: problem complexity and approximation algorithms, Power domination on permutation graphs, Zero forcing in triangulations, Solving the multistage PMU placement problem by integer programming and equivalent network design model, Restricted power domination and zero forcing problems, Minimum rank and zero forcing number for butterfly networks, Connected power domination in graphs, An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}, A note on power domination in grid graphs, Power domination in graphs, Power domination in block graphs, On minimal geodetic domination in graphs, On the Power Domination Number of Graph Products, Power domination in cylinders, tori, and generalized Petersen graphs, Power Domination Parameters in Honeycomb-Like Networks, Observing the State of a Smart Grid Using Bilevel Programming
