Pages that link to "Item:Q4785698"
From MaRDI portal
The following pages link to Domination in Graphs Applied to Electric Power Networks (Q4785698):
Displaying 50 items.
- Resolving-power dominating sets (Q299722) (← links)
- Hybrid search for the optimal PMU placement problem on a power grid (Q319263) (← links)
- Power domination of the Cartesian product of graphs (Q322042) (← links)
- \(k\)-rainbow domatic numbers (Q423920) (← links)
- Generalized power domination of graphs (Q444434) (← links)
- Power domination in certain chemical structures (Q491607) (← links)
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← 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)
- Parameterized power domination complexity (Q844180) (← links)
- Approximating the minimum weight weak vertex cover (Q860818) (← links)
- Experiments on data reduction for optimal domination in networks (Q863574) (← links)
- On the \({k}\)-power domination of hypergraphs (Q887853) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← 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)
- Computational study on planar dominating set problem (Q1040587) (← links)
- Nordhaus-Gaddum problems for power domination (Q1627850) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Observability of power systems with optimal PMU placement (Q1652693) (← links)
- Note on power propagation time and lower bounds for the power domination number (Q1680484) (← links)
- Power domination in Knödel graphs and Hanoi graphs (Q1692626) (← links)
- Complexity and lowers bounds for power edge set problem (Q1711663) (← links)
- Zero forcing in iterated line digraphs (Q1727740) (← links)
- On the total forcing number of a graph (Q1730228) (← links)
- On 2-rainbow domination of generalized Petersen graphs (Q1730265) (← links)
- The zero forcing polynomial of a graph (Q1732095) (← links)
- Complexity and inapproximability results for the power edge set problem (Q1743493) (← links)
- The relationship between \(k\)-forcing and \(k\)-power domination (Q1744766) (← links)
- Grundy dominating sequences and zero forcing sets (Q1751247) (← 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)
- A zero forcing technique for bounding sums of eigenvalue multiplicities (Q1979365) (← 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)
- Note on forcing problem of trees (Q2062888) (← links)
- Product throttling (Q2073191) (← links)
- A note on connected domination number and leaf number (Q2099474) (← links)
- Generalized power domination in claw-free regular graphs (Q2117535) (← links)
- On trees and unicyclic graphs with equal forcing-type numbers (Q2147600) (← links)
- Hardness results of connected power domination for bipartite graphs and chordal graphs (Q2150586) (← links)
- An upper bound for the \(k\)-power domination number in \(r\)-uniform hypergraphs (Q2166291) (← links)
- Power domination in cubic graphs and Cartesian products (Q2166320) (← links)
