Power domination of the Cartesian product of graphs
From MaRDI portal
Publication:322042
DOI10.1016/j.akcej.2016.02.004zbMath1346.05247OpenAlexW2325624638MaRDI QIDQ322042
Publication date: 14 October 2016
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2016.02.004
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (7)
Power domination in cubic graphs and Cartesian products ⋮ On the power domination number of the Cartesian product of graphs ⋮ 2-power domination number for Knödel graphs and its application in communication networks ⋮ Power Domination in Graphs ⋮ Unnamed Item ⋮ Power domination on triangular grids with triangular and hexagonal shape ⋮ Some product graphs with power dominating number at most 2
Cites Work
- A note on power domination in grid graphs
- A note on power domination problem in diameter two graphs
- Power domination in cylinders, tori, and generalized Petersen graphs
- Power Domination in Product Graphs
- Domination in Graphs Applied to Electric Power Networks
- Power domination in planar graphs with small diameter
- Unnamed Item
This page was built for publication: Power domination of the Cartesian product of graphs