Generalized power domination: propagation radius and Sierpiński graphs

DOI10.1007/s10440-014-9870-7zbMath1307.05173OpenAlexW2155175406MaRDI QIDQ2255613

Paul Dorbec, Sandi Klavžar

Publication date: 17 February 2015

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10440-014-9870-7

zbMATH Keywords

dominationpower dominationelectrical network monitoringSierpiński graphpropagation radius

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Applications of graph theory to circuits and networks (94C15)

Related Items

Packing chromatic number of base-3 Sierpiński graphs ⋮ The k-power bondage number of a graph ⋮ Power domination in Mycielskian of spiders ⋮ Power domination in Knödel graphs and Hanoi graphs ⋮ Connected power domination in graphs ⋮ 2-power domination number for Knödel graphs and its application in communication networks ⋮ The relationship between \(k\)-forcing and \(k\)-power domination ⋮ A survey and classification of Sierpiński-type graphs ⋮ Graphs that are simultaneously efficient open domination and efficient closed domination graphs ⋮ Grundy dominating sequences and zero forcing sets ⋮ On the zero forcing number of generalized Sierpinski graphs ⋮ Power Domination in Graphs ⋮ Power domination on triangular grids with triangular and hexagonal shape ⋮ Power domination throttling ⋮ Some product graphs with power dominating number at most 2 ⋮ Generalized power domination in claw-free regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Sierpiński graphs as spanning subgraphs of Hanoi graphs
• Coloring Hanoi and Sierpiński graphs
• Generalized power domination of graphs
• The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs
• The hub number of Sierpiński-like graphs
• Shortest paths in Sierpiński graphs
• Parameterized power domination complexity
• Improved algorithms and complexity results for power domination in graphs
• Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
• Hamiltonian connectivity of the WK-recursive network with faulty nodes
• The average eccentricity of Sierpiński graphs
• Power domination in circular-arc graphs
• The linear \(t\)-colorings of Sierpiński-like graphs
• New results on variants of covering codes in Sierpiński graphs
• A note on power domination in grid graphs
• Power domination in graphs
• Power domination in block graphs
• Generalized Power Domination in Regular Graphs
• The Tower of Hanoi – Myths and Maths
• Fractals and Universal Spaces in Dimension Theory
• Power Domination in Product Graphs
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• Domination in Graphs Applied to Electric Power Networks
• 1-perfect codes in Sierpiński graphs
• On distances in Sierpiński graphs: Almost-extreme vertices and metric dimension
• The PMU Placement Problem
• Approximation Algorithms and Hardness for Domination with Propagation

This page was built for publication: Generalized power domination: propagation radius and Sierpiński graphs