The following pages link to Power domination in graphs (Q2502911):
Displaying 50 items.
- Hybrid search for the optimal PMU placement problem on a power grid (Q319263) (← links)
- Generalized power domination of graphs (Q444434) (← links)
- Upper bounds on the \(k\)-forcing number of a graph (Q479006) (← links)
- Power domination in certain chemical structures (Q491607) (← links)
- Restricted power domination and fault-tolerant power domination on grids (Q708342) (← links)
- On the power domination number of the generalized Petersen graphs (Q719033) (← links)
- Power domination in regular claw-free graphs (Q777411) (← links)
- Power domination on triangular grids with triangular and hexagonal shape (Q782760) (← links)
- On the \({k}\)-power domination of hypergraphs (Q887853) (← links)
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results (Q987496) (← links)
- Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees (Q1032812) (← links)
- Nordhaus-Gaddum problems for power domination (Q1627850) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Power domination in Knödel graphs and Hanoi graphs (Q1692626) (← links)
- On the total forcing number of a graph (Q1730228) (← links)
- The zero forcing polynomial of a graph (Q1732095) (← links)
- Bounds on the connected forcing number of a graph (Q1756082) (← links)
- Approximating the minimum rank of a graph via alternating projection (Q1785758) (← links)
- Power domination in circular-arc graphs (Q1939660) (← links)
- Total forcing versus total domination in cubic graphs (Q2011113) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- Zero forcing versus domination in cubic graphs (Q2025087) (← links)
- On a conjecture for power domination (Q2042204) (← links)
- Disproofs of three conjectures on the power domination of graphs (Q2057589) (← links)
- Tight bounds on probabilistic zero forcing on hypercubes and grids (Q2073291) (← links)
- Efficient and non-efficient domination of \(\mathbb{Z}\)-stacked Archimedean lattices (Q2089545) (← links)
- Generalized power domination in claw-free regular graphs (Q2117535) (← links)
- On the zero forcing number and spectral radius of graphs (Q2121770) (← links)
- On trees and unicyclic graphs with equal forcing-type numbers (Q2147600) (← links)
- Power domination in cubic graphs and Cartesian products (Q2166320) (← links)
- Power domination in the generalized Petersen graphs (Q2175230) (← links)
- Probabilistic zero forcing on random graphs (Q2225411) (← links)
- Generalized power domination: propagation radius and Sierpiński graphs (Q2255613) (← links)
- Infectious power domination of hypergraphs (Q2286585) (← links)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- Power domination throttling (Q2330105) (← links)
- Extremal \(k\)-forcing sets in oriented graphs (Q2416417) (← links)
- Restricted power domination and zero forcing problems (Q2424658) (← links)
- A cutting-plane algorithm for solving a weighted influence interdiction problem (Q2436687) (← links)
- Power domination in block graphs (Q2503302) (← links)
- Throttling processes equivalent to full throttling on trees (Q2661773) (← links)
- Some properties of the closed global shadow graphs and their zero forcing number (Q2674159) (← links)
- On the Power Domination Number of Graph Products (Q2795962) (← links)
- Power domination in cylinders, tori, and generalized Petersen graphs (Q3113506) (← links)
- Algorithms and Complexity of Power Domination in Graphs (Q3384121) (← links)
- Power Domination in Graphs (Q3384619) (← links)
- The forcing number of graphs with given girth (Q4639236) (← links)
- Power domination in honeycomb networks (Q4648989) (← links)
- k-Forcing number for Cartesian product of some graphs (Q4986275) (← links)
- Power domination number of sunlet graph and other graphs (Q5036755) (← links)