Metric-locating-dominating sets of graphs for constructing related subsets of vertices
From MaRDI portal
Publication:2333263
DOI10.1016/J.AMC.2018.03.053zbMATH Open1427.05158OpenAlexW2797099654WikidataQ130015275 ScholiaQ130015275MaRDI QIDQ2333263FDOQ2333263
Authors: Yanyan Li
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
Recommendations
dominating setresolving setlocating-dominating setdoubly resolving setmetric-locating-dominating set
Cites Work
- Title not available (Why is that?)
- Resolvability in graphs and the metric dimension of a graph
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
- Base size, metric dimension and other invariants of groups and graphs
- On the Metric Dimension of Cartesian Products of Graphs
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nordhaus-Gaddum bounds for locating domination
- Title not available (Why is that?)
- Title not available (Why is that?)
- Towards a theory of domination in graphs
- Locating-domination and identifying codes in trees
- On Metric Generators of Graphs
- Locating-dominating codes: bounds and extremal cardinalities
- The difference between the metric dimension and the determining number of a graph
- Resolving-power dominating sets
- Title not available (Why is that?)
- Identifying graph automorphisms using determining sets
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Locating-dominating sets in twin-free graphs
- Approximability of the minimum weighted doubly resolving set problem
- Budgeted sensor placement for source localization on trees
- Location-domination in line graphs
- Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
- Computing minimal doubly resolving sets of graphs
- Locating and paired-dominating sets in graphs
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
- Fault-tolerant locating-dominating sets
- Title not available (Why is that?)
- Approximability of identifying codes and locating-dominating codes
- On locating--dominating sets in infinite grids
- Optimal open-locating-dominating sets in infinite triangular grids
- Minimal doubly resolving sets of prism graphs
- Approximation for the minimum cost doubly resolving set problem
- A sharp lower bound for locating-dominating sets in trees
- Locating-dominating sets and identifying codes in graphs of girth at least 5
- The resolving number of a graph
Cited In (10)
- The doubly metric dimension of cylinder graphs and torus graphs
- Title not available (Why is that?)
- The equidistant dimension of graphs
- On the dominant local metric dimension of some planar graphs
- \( [ 1 , 2 ]\)-dimension of graphs
- Title not available (Why is that?)
- Resolving dominating partitions in graphs
- Local metric dimension of graphs: generalized hierarchical products and some applications
- Nordhaus-Gaddum bounds for locating domination
- Metric dimension of maximal outerplanar 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)