Resolving-power dominating sets
From MaRDI portal
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Recommendations
Cites work
- An efficient representation of Benes networks and its applications
- Domination in Graphs Applied to Electric Power Networks
- Generalized power domination of graphs
- 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?)
- Landmarks in graphs
- Power domination in certain chemical structures
- Resolvability in graphs and the metric dimension of a graph
Cited in
(4)
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)