Power domination in block graphs

DOI10.1016/J.TCS.2006.04.011MaRDI QIDQ2503302zbMATH OpenOpenAlexFDO

Authors Guangjun Xu, Erfang Shan, Min Zhao, Liying Kang

Publication date 14 September 2006

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2006.04.011

zbMATH Keywords

algorithmblock graphselectric power system

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• \(k\)-power domination in block graphs
• scientific article; zbMATH DE number 5138348
• Domination in Graphs Applied to Electric Power Networks
• Power domination with bounded time constraints
• Power domination in graphs

Cites work

• Domination in Graphs Applied to Electric Power Networks
• Graph theory
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Power domination in graphs
• The bottleneck independent domination on the classes of bipartite graphs and block graphs.
• Total domination in block graphs

Cited in

(43)

• On computing a minimum secure dominating set in block graphs
• Complexity and inapproximability results for the power edge set problem
• Power domination in circular-arc graphs
• Complexity and computation of connected zero forcing
• Disproofs of three conjectures on the power domination of graphs
• Generalized power domination in claw-free regular graphs
• Roman \(\{2\}\)-domination problem in graphs
• A linear-time algorithm for weighted paired-domination on block graphs
• Power domination in the generalized Petersen graphs
• Generalized power domination: propagation radius and Sierpiński graphs
• The k-power domination problem in weighted trees
• Power domination throttling
• Restricted power domination and zero forcing problems
• Connected power domination in graphs
• An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}
• Power domination in graphs
• Resolving-power dominating sets
• Power domination in cylinders, tori, and generalized Petersen graphs
• Power domination parameters in honeycomb-like networks
• Algorithms and complexity of power domination in graphs
• Power domination in graphs
• Generalized power domination of graphs
• Power domination in honeycomb networks
• Domination in Graphs Applied to Electric Power Networks
• Power domination in certain chemical structures
• scientific article; zbMATH DE number 7493307 (Why is no real title available?)
• Power domination in Mycielskian of spiders
• Computing and Combinatorics
• Power domination with bounded time constraints
• \(k\)-power domination in block graphs
• The \(k\)-power domination problem in weighted trees
• New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts
• Labeling algorithm for power domination problem of trees
• Power domination in Mycielskians of n -spiders
• A note proving the nullity of block graphs is unbounded
• k-fault tolerant power domination number for block graphs
• Power domination in generalized Mycielskian of cycles
• An efficient algorithm for power dominating set
• Power domination in generalized Mycielskian of spiders
• Restricted power domination and fault-tolerant power domination on grids
• On the power domination number of the generalized Petersen graphs
• Power domination in regular claw-free graphs
• Power domination on triangular grids with triangular and hexagonal shape

This page was built for publication: Power domination in block graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2503302)