Resolving-power dominating sets

DOI10.1016/J.AMC.2015.01.037zbMATH Open1338.05218OpenAlexW1981017828MaRDI QIDQ299722FDOQ299722

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

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

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)

Cites Work

• Title not available (Why is that?)
• Resolvability in graphs and the metric dimension of a graph
• Title not available (Why is that?)
• Landmarks in graphs
• An efficient representation of Benes networks and its applications
• Generalized power domination of graphs
• Domination in Graphs Applied to Electric Power Networks
• Power domination in certain chemical structures
• Title not available (Why is that?)

Cited In (2)

• Resolving dominating partitions in graphs
• Metric-locating-dominating sets of graphs for constructing related subsets of vertices

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)