Pages that link to "Item:Q4785698"

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

Displaying 30 items.

• 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₅-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)
• Product throttling for power domination (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)
• (Q6150952) (← links)
• Average distance and connected domination (Q6166238) (← links)
• The zero forcing number of graphs with the matching number and the cyclomatic number (Q6172214) (← links)
• 2-power domination number for Knödel graphs and its application in communication networks (Q6181254) (← links)
• Failed power domination in grids, cylinders, and tori (Q6202307) (← links)
• Exact and heuristic algorithms for the domination problem (Q6555173) (← links)
• The \(k\) edge-vertex domination problem (Q6591483) (← links)
• Bounds on zero forcing using (upper) total domination and minimum degree (Q6601135) (← links)
• Hardness results of connected power domination for bipartite graphs and chordal graphs (Q6610089) (← links)
• On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs (Q6633544) (← links)
• The zero forcing number of claw-free cubic graphs (Q6633547) (← links)
• Power domination in Mycielskians of <i>n</i> -spiders (Q6643344) (← links)
• Minimal zero forcing sets (Q6644905) (← links)