Resolving vertices of graphs with differences
From MaRDI portal
Publication:6569070
DOI10.1007/S40314-024-02806-3MaRDI QIDQ6569070
Ismael G. Yero, Jelena Sedlar, Iztok Peterin, Riste Škrekovski
Publication date: 8 July 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Uniquely identifying the edges of a graph: the edge metric dimension
- Mixed metric dimension of graphs
- Metric dimension of maximal outerplanar graphs
- Extremal results for graphs of bounded metric dimension
- Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two
- On the robustness of the metric dimension of grid graphs to adding a single edge
- On vertices contained in all or in no metric basis
- Learning to compute the metric dimension of graphs
- A note on \(k\)-metric dimensional graphs
- Some binary products and integer linear programming for \(k\)-metric dimension of graphs
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
This page was built for publication: Resolving vertices of graphs with differences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6569070)
