Generalized Power Domination in Regular Graphs
From MaRDI portal
Publication:2870522
DOI10.1137/120891356zbMath1290.05117OpenAlexW2083575592MaRDI QIDQ2870522
Mickaël Montassier, Michael A. Henning, Paul Dorbec, Andre Raspaud, Christian Löwenstein
Publication date: 21 January 2014
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/120891356
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (17)
Nordhaus-Gaddum problems for power domination ⋮ 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 ⋮ 2-power domination number for Knödel graphs and its application in communication networks ⋮ The relationship between \(k\)-forcing and \(k\)-power domination ⋮ Generalized power domination: propagation radius and Sierpiński graphs ⋮ Zero forcing versus domination in cubic graphs ⋮ On the Power Domination Number of Graph Products ⋮ Power domination with bounded time constraints ⋮ \(k\)-power domination in block graphs ⋮ On a conjecture for power domination ⋮ Algorithms and Complexity of Power Domination in Graphs ⋮ Power Domination in Graphs ⋮ Disproofs of three conjectures on the power domination of graphs ⋮ Power domination in regular claw-free graphs ⋮ Generalized power domination in claw-free regular graphs
This page was built for publication: Generalized Power Domination in Regular Graphs
