Pages that link to "Item:Q2424811"
From MaRDI portal
The following pages link to Connected power domination in graphs (Q2424811):
Displaying 17 items.
- Resolving-power dominating sets (Q299722) (← links)
- Power domination on triangular grids with triangular and hexagonal shape (Q782760) (← links)
- On the semitotal forcing number of a graph (Q2134991) (← links)
- Hardness results of connected power domination for bipartite graphs and chordal graphs (Q2150586) (← links)
- Infectious power domination of hypergraphs (Q2286585) (← links)
- The probabilistic and reliable connected power dominating set problems (Q2311207) (← links)
- Power domination throttling (Q2330105) (← links)
- Restricted power domination and zero forcing problems (Q2424658) (← links)
- Power domination in graphs (Q2502911) (← links)
- Power domination in cylinders, tori, and generalized Petersen graphs (Q3113506) (← links)
- Algorithms and Complexity of Power Domination in Graphs (Q3384121) (← links)
- Domination in Graphs Applied to Electric Power Networks (Q4785698) (← links)
- CONNECTED dr-POWER DOMINATING SETS IN GRAPHS (Q4973395) (← links)
- (Q5065227) (← links)
- Improved Computational Approaches and Heuristics for Zero Forcing (Q5084604) (← links)
- Power domination with bounded time constraints (Q5963647) (← links)
- Hardness results of connected power domination for bipartite graphs and chordal graphs (Q6610089) (← links)