Pages that link to "Item:Q4785698"
From MaRDI portal
The following pages link to Domination in Graphs Applied to Electric Power Networks (Q4785698):
Displayed 50 items.
- The complexity of finding harmless individuals in social networks (Q2339843) (← links)
- Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
- Power domination on permutation graphs (Q2416432) (← links)
- Zero forcing in triangulations (Q2423536) (← links)
- Solving the multistage PMU placement problem by integer programming and equivalent network design model (Q2423817) (← links)
- Restricted power domination and zero forcing problems (Q2424658) (← links)
- Minimum rank and zero forcing number for butterfly networks (Q2424660) (← links)
- Connected power domination in graphs (Q2424811) (← links)
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350) (← links)
- A note on power domination in grid graphs (Q2492204) (← links)
- Power domination in graphs (Q2502911) (← links)
- Power domination in block graphs (Q2503302) (← links)
- On minimal geodetic domination in graphs (Q2516666) (← 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)
- The restrained double Roman domination in graphs (Q2683144) (← links)
- On the Power Domination Number of Graph Products (Q2795962) (← links)
- Power domination in cylinders, tori, and generalized Petersen graphs (Q3113506) (← links)
- Power Domination Parameters in Honeycomb-Like Networks (Q3296853) (← links)
- Algorithms and Complexity of Power Domination in Graphs (Q3384121) (← links)
- Power Domination in Graphs (Q3384619) (← links)
- Observing the State of a Smart Grid Using Bilevel Programming (Q3467857) (← links)
- (Q4611353) (← links)
- The forcing number of graphs with given girth (Q4639236) (← links)
- Power domination in honeycomb networks (Q4648989) (← links)
- GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED (Q4956465) (← links)
- The signed Roman domination number of two classes graphs (Q4965890) (← links)
- CONNECTED dr-POWER DOMINATING SETS IN GRAPHS (Q4973395) (← links)
- Edge Forcing in Butterfly Networks (Q5025049) (← links)
- Power domination number of sunlet graph and other graphs (Q5036755) (← links)
- (Q5065227) (← links)
- Improved Computational Approaches and Heuristics for Zero Forcing (Q5084604) (← links)
- Power domination in Mycielskian of spiders (Q5097786) (← links)
- Failed power domination on graphs (Q5109066) (← links)
- Zero forcing in Benzenoid network (Q5142119) (← links)
- Power domination in generalized undirected de Bruijn graphs and Kautz graphs (Q5245856) (← links)
- Domination problems on P<sub>5</sub>-free graphs (Q5248877) (← links)
- Minimum Power Dominating Sets of Random Cubic Graphs (Q5272639) (← links)
- The k-power bondage number of a graph (Q5298349) (← links)
- (Q5374237) (← links)
- Power domination in planar graphs with small diameter (Q5436223) (← links)
- Some product graphs with power dominating number at most 2 (Q5861699) (← links)
- Vertex sequences in graphs (Q5862692) (← links)
- (Q5883635) (← links)
- Power domination with bounded time constraints (Q5963647) (← links)
- \(k\)-power domination in block graphs (Q5963656) (← links)
- Immune sets in monotone infection rules. Characterization and complexity (Q6064851) (← links)
- New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts (Q6065861) (← links)
- Labeling algorithm for power domination problem of trees (Q6096257) (← links)
- An iterated greedy algorithm for finding the minimum dominating set in graphs (Q6102924) (← links)