Pages that link to "Item:Q4785698"

The following pages link to Domination in Graphs Applied to Electric Power Networks (Q4785698):

Displaying 50 items.

• Power domination in the generalized Petersen graphs (Q2175230) (← links)
• Total forcing sets and zero forcing sets in trees (Q2175233) (← links)
• On the power domination number of the Cartesian product of graphs (Q2176150) (← links)
• Complexity of domination in triangulated plane graphs (Q2178742) (← links)
• Zero forcing and maximum nullity for hypergraphs (Q2185737) (← links)
• Grundy domination and zero forcing in regular graphs (Q2238998) (← links)
• On leaky forcing and resilience (Q2243134) (← links)
• Generalized power domination: propagation radius and Sierpiński graphs (Q2255613) (← links)
• Algorithms and applications for a class of bilevel MILPs (Q2283108) (← links)
• Infectious power domination of hypergraphs (Q2286585) (← links)
• The \(k\)-power domination problem in weighted trees (Q2290632) (← links)
• On the zero forcing number of a graph involving some classical parameters (Q2292148) (← links)
• Zero forcing in claw-free cubic graphs (Q2302052) (← links)
• The probabilistic and reliable connected power dominating set problems (Q2311207) (← links)
• Power domination throttling (Q2330105) (← links)
• 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)
• Disjoint Sets in Graphs and its Application to Electrical Networks (Q3089062) (← 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)
• (Q3428640) (← 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)