Metric-locating-dominating sets of graphs for constructing related subsets of vertices
From MaRDI portal
Publication:2333263
DOI10.1016/j.amc.2018.03.053zbMath1427.05158OpenAlexW2797099654MaRDI QIDQ2333263
Publication date: 12 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/116408
dominating setresolving setlocating-dominating setdoubly resolving setmetric-locating-dominating set
Related Items (7)
The equidistant dimension of graphs ⋮ On the dominant local metric dimension of some planar graphs ⋮ \( [ 1 , 2 \)-dimension of graphs] ⋮ Resolving dominating partitions in graphs ⋮ Local metric dimension of graphs: generalized hierarchical products and some applications ⋮ Metric dimension of maximal outerplanar graphs ⋮ The doubly metric dimension of cylinder graphs and torus graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The difference between the metric dimension and the determining number of a graph
- Resolving-power dominating sets
- Budgeted sensor placement for source localization on trees
- Location-domination in line graphs
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
- On locating--dominating sets in infinite grids
- Identifying graph automorphisms using determining sets
- Approximation for the minimum cost doubly resolving set problem
- Locating-dominating codes: bounds and extremal cardinalities
- Locating-dominating sets in twin-free graphs
- Locating and paired-dominating sets in graphs
- Computing minimal doubly resolving sets of graphs
- Resolvability in graphs and the metric dimension of a graph
- Fault-tolerant locating-dominating sets
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
- Locating-dominating sets and identifying codes in graphs of girth at least 5
- Optimal open-locating-dominating sets in infinite triangular grids
- Approximability of identifying codes and locating-dominating codes
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Nordhaus-Gaddum bounds for locating domination
- Minimal doubly resolving sets of prism graphs
- Approximability of the Minimum Weighted Doubly Resolving Set Problem
- Base size, metric dimension and other invariants of groups and graphs
- On the Metric Dimension of Cartesian Products of Graphs
- Towards a theory of domination in graphs
- Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
- On Metric Generators of Graphs
- The resolving number of a graph
This page was built for publication: Metric-locating-dominating sets of graphs for constructing related subsets of vertices
