The solid-metric dimension
DOI10.1016/J.TCS.2019.02.013zbMATH Open1436.68241OpenAlexW2917237471WikidataQ128341804 ScholiaQ128341804MaRDI QIDQ2285129FDOQ2285129
Authors: Anni Hakanen, Ville Junnila, Tero Laihonen 
Publication date: 16 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.02.013
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distance in graphs (05C12)
Cites Work
- Resolvability in graphs and the metric dimension of a graph
- On the Metric Dimension of Cartesian Products of Graphs
- Title not available (Why is that?)
- Landmarks in graphs
- \(k\)-metric resolvability in graphs
- Title not available (Why is that?)
- On Metric Generators of Graphs
- A decomposition theorem for partially ordered sets
- On a new class of identifying codes in graphs
- Boundary vertices in graphs
- Title not available (Why is that?)
- Domination and location in acyclic graphs
- The Dilworth Number of a Graph
- On {ℓ}-Metric Dimensions in Graphs
- On regular and new types of codes for location-domination
- The metric dimension for resolving several objects
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: The solid-metric dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2285129)
