On the geodesic identification of vertices in convex plane graphs
From MaRDI portal
Publication:2217853
DOI10.1155/2020/7483291zbMATH Open1459.05058OpenAlexW3115842894MaRDI QIDQ2217853FDOQ2217853
Authors: Yanyan Li
Publication date: 14 January 2021
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/7483291
Recommendations
Cites Work
- Resolvability in graphs and the metric dimension of a graph
- On the Metric Dimension of Cartesian Products of Graphs
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
- On families of convex polytopes with constant metric dimension
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the strong metric dimension of corona product graphs and join graphs
- Landmarks in graphs
- Simultaneous resolvability in graph families
- The local metric dimension of a graph
- On the strong metric dimension of Cartesian and direct products of graphs
- Resolving domination in graphs
- The independent resolving number of a graph
- On Metric Generators of Graphs
- The strong metric dimension of graphs and digraphs
- The fractional strong metric dimension of graphs
- On the fractional strong metric dimension of graphs
- The fractional metric dimension of graphs
- The (weighted) metric dimension of graphs: hard and easy cases
- On the strong metric dimension of the strong products of graphs
- On strong metric dimension of graphs and their complements
- Variable neighborhood search for the strong metric dimension problem
- Strong metric dimension: a survey
- The strong dimension of distance-hereditary graphs
- Closed formulae for the strong metric dimension of lexicographic product graphs
- Computing strong metric dimension of some special classes of graphs by genetic algorithms
- Strong metric dimension of rooted product graphs
- Mastermind
- Mixed metric dimension of graphs
- Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
- A Combinatory Detection Problem
- On optimal approximability results for computing the strong metric dimension
- On the Strong Metric Dimension of Cartesian Sum Graphs
- The fractional strong metric dimension in three graph products
- Strong resolving graphs: the realization and the characterization problems
- The strong metric dimension of generalized Sierpiński graphs with pendant vertices
- The strong metric dimension of the power graph of a finite group
- On metric dimension of convex polytopes with pendant edges.
- The solid-metric dimension
- Minimum fault-tolerant, local and strong metric dimension of graphs.
- On the strong metric dimension of some related wheel graph
- Title not available (Why is that?)
This page was built for publication: On the geodesic identification of vertices in convex plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2217853)