Resolving-power dominating sets

DOI10.1016/J.AMC.2015.01.037MaRDI QIDQ299722zbMATHOpenAlexFDO

Authors Sudeep Stephen, Cyriac Grigorious, Albert William, Bharati Rajan

Publication date 22 June 2016

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2015.01.037

zbMATH Keywords

dominationmetric dimensionpower domination

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Domination in Graphs Applied to Electric Power Networks
• Power domination in block graphs
• Improved algorithms and complexity results for power domination in graphs
• Fundamentals of Computation Theory
• Connected power domination in graphs

Cites work

• scientific article; zbMATH DE number 3544092 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 2192146 (Why is no real title available?)
• An efficient representation of Benes networks and its applications
• Domination in Graphs Applied to Electric Power Networks
• Generalized power domination of graphs
• Landmarks in graphs
• Power domination in certain chemical structures
• Resolvability in graphs and the metric dimension of a graph

Cited in

(3)

• Metric-locating-dominating sets of graphs for constructing related subsets of vertices
• Resolving dominating partitions in graphs
• The complexity of monitoring a network with both watchers and listeners

This page was built for publication: Resolving-power dominating sets

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