Resolving-power dominating sets

DOI10.1016/j.amc.2015.01.037zbMath1338.05218OpenAlexW1981017828MaRDI QIDQ299722

Cyriac Grigorious, Sudeep Stephen, Albert William, Bharathi 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

dominationpower dominationmetric dimension

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized power domination of graphs
• Power domination in certain chemical structures
• An efficient representation of Benes networks and its applications
• Resolvability in graphs and the metric dimension of a graph
• Landmarks in graphs
• Domination in Graphs Applied to Electric Power Networks

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