Domination in Graphs Applied to Electric Power Networks
From MaRDI portal
Publication:4785698
DOI10.1137/S0895480100375831zbMath1006.05043OpenAlexW2023728975MaRDI 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)
Full work available at URL: https://doi.org/10.1137/s0895480100375831
Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (only showing first 100 items - show all)
The k-power bondage number of a graph ⋮ Immune sets in monotone infection rules. Characterization and complexity ⋮ New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts ⋮ Labeling algorithm for power domination problem of trees ⋮ An iterated greedy algorithm for finding the minimum dominating set in graphs ⋮ Linear-time algorithm for paired-domination on distance-hereditary graphs ⋮ Average distance and connected domination ⋮ 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 ⋮ Failed power domination in grids, cylinders, and tori ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Power domination in planar graphs with small diameter ⋮ Power domination with bounded time constraints ⋮ \(k\)-power domination in block graphs ⋮ Unnamed Item ⋮ Power domination in generalized undirected de Bruijn graphs and Kautz graphs ⋮ Domination problems on P5-free graphs ⋮ Some product graphs with power dominating number at most 2 ⋮ Vertex sequences in graphs ⋮ Minimum Power Dominating Sets of Random Cubic Graphs ⋮ GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED ⋮ Power domination number of sunlet graph and other graphs ⋮ Nordhaus-Gaddum problems for power domination ⋮ Computational approaches for zero forcing and related problems ⋮ Resolving-power dominating sets ⋮ Parameterized power domination complexity ⋮ Hybrid search for the optimal PMU placement problem on a power grid ⋮ On trees and unicyclic graphs with equal forcing-type numbers ⋮ Power domination of the Cartesian product of graphs ⋮ Hardness results of connected power domination for bipartite graphs and chordal graphs ⋮ Observing the State of a Smart Grid Using Bilevel Programming ⋮ Observability of power systems with optimal PMU placement ⋮ Approximating the minimum weight weak vertex cover ⋮ Experiments on data reduction for optimal domination in networks ⋮ An upper bound for the \(k\)-power domination number in \(r\)-uniform hypergraphs ⋮ Power domination in cubic graphs and Cartesian products ⋮ Improved Computational Approaches and Heuristics for Zero Forcing ⋮ Throttling processes equivalent to full throttling on trees ⋮ 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 ⋮ Note on power propagation time and lower bounds for the power domination number ⋮ On the \({k}\)-power domination of hypergraphs ⋮ Power domination in Mycielskian of spiders ⋮ Power domination on permutation graphs ⋮ Some properties of the closed global shadow graphs and their zero forcing number ⋮ Zero forcing and maximum nullity for hypergraphs ⋮ Zero forcing in triangulations ⋮ Solving the multistage PMU placement problem by integer programming and equivalent network design model ⋮ Power domination in Knödel graphs and Hanoi graphs ⋮ The restrained double Roman domination in graphs ⋮ Restricted power domination and zero forcing problems ⋮ Minimum rank and zero forcing number for butterfly networks ⋮ Power domination in circular-arc graphs ⋮ Connected power domination in graphs ⋮ \(k\)-rainbow domatic numbers ⋮ An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} ⋮ Generalized power domination of 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 ⋮ Zero forcing in Benzenoid network ⋮ Power Domination Parameters in Honeycomb-Like Networks ⋮ The zero forcing polynomial of a graph ⋮ Power domination in certain chemical structures ⋮ A zero forcing technique for bounding sums of eigenvalue multiplicities ⋮ The forcing number of graphs with given girth ⋮ On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size ⋮ Grundy domination and zero forcing in regular graphs ⋮ Complexity and inapproximability results for the power edge set problem ⋮ The relationship between \(k\)-forcing and \(k\)-power domination ⋮ On leaky forcing and resilience ⋮ Power domination in honeycomb networks ⋮ A survey and classification of Sierpiński-type graphs ⋮ Grundy dominating sequences and zero forcing sets ⋮ Improved algorithms and complexity results for power domination in graphs ⋮ Bounds on the connected forcing number of a graph ⋮ Unnamed Item ⋮ Generalized power domination: propagation radius and Sierpiński graphs ⋮ Total forcing versus total domination in cubic graphs ⋮ Complexity and computation of connected zero forcing ⋮ A note on power domination in grid graphs ⋮ Restricted power domination and fault-tolerant power domination on grids ⋮ Failed power domination on graphs ⋮ Domination in graphs with bounded propagation: Algorithms, formulations and hardness results ⋮ On the power domination number of the generalized Petersen graphs ⋮ Zero forcing versus domination in cubic graphs ⋮ Power domination in graphs ⋮ Power domination in block graphs ⋮ Approximating the minimum rank of a graph via alternating projection ⋮ Algorithms and applications for a class of bilevel MILPs ⋮ On the Power Domination Number of Graph Products ⋮ Infectious power domination of hypergraphs ⋮ The \(k\)-power domination problem in weighted trees ⋮ On minimal geodetic domination in graphs ⋮ On the zero forcing number of a graph involving some classical parameters
This page was built for publication: Domination in Graphs Applied to Electric Power Networks
