Some product graphs with power dominating number at most 2

DOI10.1080/09728600.2021.1972773zbMath1483.05125OpenAlexW3198125812MaRDI QIDQ5861699

Adel P. Kazemi, Najibeh Shahbaznejad, Ignacio M. Pelayo

Publication date: 2 March 2022

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09728600.2021.1972773

zbMATH Keywords

dominationpower dominationzero forcingelectric power monitoring

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Power domination of the Cartesian product of graphs
• Nordhaus-Gaddum problems for power domination
• Generalized power domination: propagation radius and Sierpiński graphs
• A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
• Zero forcing sets and the minimum rank of graphs
• A note on power domination in grid graphs
• Power domination in graphs
• On the Power Domination Number of Graph Products
• Domination in Graphs Applied to Electric Power Networks
• Domination numbers of planar graphs

This page was built for publication: Some product graphs with power dominating number at most 2