The following pages link to Power domination in block graphs (Q2503302):
Displaying 30 items.
- Generalized power domination of graphs (Q444434) (← 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 computing a minimum secure dominating set in block graphs (Q1702842) (← links)
- Complexity and inapproximability results for the power edge set problem (Q1743493) (← links)
- Power domination in circular-arc graphs (Q1939660) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- Disproofs of three conjectures on the power domination of graphs (Q2057589) (← links)
- Generalized power domination in claw-free regular graphs (Q2117535) (← links)
- Roman \(\{2\}\)-domination problem in graphs (Q2118251) (← links)
- A linear-time algorithm for weighted paired-domination on block graphs (Q2168726) (← links)
- Power domination in the generalized Petersen graphs (Q2175230) (← links)
- Generalized power domination: propagation radius and Sierpiński graphs (Q2255613) (← links)
- Power domination throttling (Q2330105) (← links)
- Restricted power domination and zero forcing problems (Q2424658) (← links)
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350) (← 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 honeycomb networks (Q4648989) (← links)
- (Q5065227) (← links)
- Power domination in Mycielskian of spiders (Q5097786) (← links)
- Power domination with bounded time constraints (Q5963647) (← links)
- \(k\)-power domination in block graphs (Q5963656) (← links)
- New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts (Q6065861) (← links)
- Power domination in Mycielskians of <i>n</i> -spiders (Q6643344) (← links)
- A note proving the nullity of block graphs is unbounded (Q6646411) (← links)
