Power domination in cubic graphs and Cartesian products

DOI10.1016/j.disc.2022.113113zbMath1495.05206arXiv2209.03931OpenAlexW4299987540MaRDI QIDQ2166320

Sarah E. Anderson, Kirsti Kuenzel

Publication date: 24 August 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.03931

zbMATH Keywords

Cartesian productscubic graphsmultigraphspower domination

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Power domination of the Cartesian product of graphs
• Perfect matchings in claw-free cubic graphs
• On zero-sum \(\mathbb Z_{2j}^k\)-magic 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
• Generalized Power Domination in Regular Graphs
• Power domination in cylinders, tori, and generalized Petersen graphs
• Domination in Graphs Applied to Electric Power Networks

This page was built for publication: Power domination in cubic graphs and Cartesian products