Power Domination in Product Graphs

DOI10.1137/060661879MaRDI QIDQ3629462zbMATH OpenOpenAlexFDO

Authors Paul Dorbec, Michel Mollard, Sandi Klavžar, Simon Špacapan

Publication date 27 May 2009

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/060661879

zbMATH Keywords

dominationelectric power monitoringgraph productspathspower domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• On the power domination number of graph products
• Recent results on the power domination numbers of graph products
• On the power domination number of the Cartesian product of graphs
• Power domination in graphs
• On the power domination number of the generalized Petersen graphs

Cited in

(45)

• Nordhaus-Gaddum problems for power domination
• Power domination in Knödel graphs and Hanoi graphs
• Power domination in circular-arc graphs
• On a conjecture for power domination
• Disproofs of three conjectures on the power domination of graphs
• Generalized power domination in claw-free regular graphs
• Power domination in cubic graphs and Cartesian products
• Power domination in the generalized Petersen graphs
• On the power domination number of the Cartesian product of graphs
• Generalized power domination: propagation radius and Sierpiński graphs
• The k-power domination problem in weighted trees
• Power domination throttling
• Power domination on permutation graphs
• Solving the multistage PMU placement problem by integer programming and equivalent network design model
• On the power domination number of graph products
• Power domination in cylinders, tori, and generalized Petersen graphs
• Power domination of the Cartesian product of graphs
• Power domination parameters in honeycomb-like networks
• Algorithms and complexity of power domination in graphs
• Power domination in graphs
• The pre-hull number and lexicographic product
• Generalized power domination of graphs
• Recent results on the power domination numbers of graph products
• Product of normal edge-transitive Cayley graphs
• Power domination in honeycomb networks
• scientific article; zbMATH DE number 7493307 (Why is no real title available?)
• Power domination in Mycielskian of spiders
• The \(k\)-power bondage number of a graph
• Zero forcing and power domination for graph products
• Some product graphs with power dominating number at most 2
• scientific article; zbMATH DE number 7666852 (Why is no real title available?)
• Power domination with bounded time constraints
• \(k\)-power domination in block graphs
• Power dominator chromatic numbers of splitting graphs of certain classes of graphs
• Product throttling for power domination
• Convex sets in lexicographic products of graphs
• Power domination in Mycielskians of n -spiders
• k-fault tolerant power domination number for block graphs
• Connected power domination number of product graphs
• Power domination in generalized Mycielskian of cycles
• Power domination in generalized Mycielskian of spiders
• On the power domination number of the generalized Petersen graphs
• Double domination in lexicographic product graphs
• Power domination in regular claw-free graphs
• Power domination on triangular grids with triangular and hexagonal shape

This page was built for publication: Power Domination in Product Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3629462)