Metric-locating-dominating sets of graphs for constructing related subsets of vertices
From MaRDI portal
Publication:2333263
Recommendations
Cites work
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 4070954 (Why is no real title available?)
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- 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 2148779 (Why is no real title available?)
- scientific article; zbMATH DE number 2192146 (Why is no real title available?)
- A sharp lower bound for locating-dominating sets in trees
- Approximability of identifying codes and locating-dominating codes
- Approximability of the minimum weighted doubly resolving set problem
- Approximation for the minimum cost doubly resolving set problem
- Base size, metric dimension and other invariants of groups and graphs
- Budgeted sensor placement for source localization on trees
- Computing minimal doubly resolving sets of graphs
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
- Fault-tolerant locating-dominating sets
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Identifying graph automorphisms using determining sets
- Locating and paired-dominating sets in graphs
- Locating-dominating codes: bounds and extremal cardinalities
- Locating-dominating sets and identifying codes in graphs of girth at least 5
- Locating-dominating sets in twin-free graphs
- Locating-domination and identifying codes in trees
- Location-domination in line graphs
- Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
- Minimal doubly resolving sets of prism graphs
- Nordhaus-Gaddum bounds for locating domination
- On Metric Generators of Graphs
- On locating--dominating sets in infinite grids
- On the Metric Dimension of Cartesian Products of Graphs
- Optimal open-locating-dominating sets in infinite triangular grids
- Resolvability in graphs and the metric dimension of a graph
- Resolving-power dominating sets
- The difference between the metric dimension and the determining number of a graph
- The resolving number of a graph
- Towards a theory of domination in graphs
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems
Cited in
(13)- scientific article; zbMATH DE number 2024674 (Why is no real title available?)
- \( [ 1 , 2 ]\)-dimension of graphs
- Local metric dimension of graphs: generalized hierarchical products and some applications
- On metric-location-domination number of graphs
- The equidistant dimension of graphs
- scientific article; zbMATH DE number 2192146 (Why is no real title available?)
- Metric dimension of maximal outerplanar graphs
- Resolving dominating partitions in graphs
- Unique metro domination in graphs
- Nordhaus-Gaddum bounds for locating domination
- On the dominant local metric dimension of some planar graphs
- On distance-\(s\) locating and distance-\(t\) dominating sets in graphs
- The doubly metric dimension of cylinder graphs and torus graphs
This page was built for publication: Metric-locating-dominating sets of graphs for constructing related subsets of vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333263)
