On the Power Domination Number of Graph Products

DOI10.1007/978-3-319-29221-2_31zbMath1444.05111OpenAlexW2395671525MaRDI QIDQ2795962

Seethu Varghese, Ambat Vijayakumar

Publication date: 23 March 2016

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-29221-2_31

zbMATH Keywords

graph productsdomination numberzero forcing numberpower domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items

The k-power bondage number of a graph, Power domination in cubic graphs and Cartesian products, Power domination in Knödel graphs and Hanoi graphs, Unnamed Item, Some product graphs with power dominating number at most 2

Cites Work

• Generalized power domination of graphs
• Dominating direct products of graphs
• Improved algorithms and complexity results for power domination in graphs
• Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
• Zero forcing sets and the minimum rank of graphs
• A note on power domination in grid graphs
• Power domination in graphs
• Generalized Power Domination in Regular Graphs
• Power domination in cylinders, tori, and generalized Petersen graphs
• Power Domination in Product Graphs
• Domination in Graphs Applied to Electric Power Networks
• Computing and Combinatorics