On the geodesic identification of vertices in convex plane graphs
From MaRDI portal
Publication:2217853
DOI10.1155/2020/7483291zbMath1459.05058OpenAlexW3115842894MaRDI QIDQ2217853
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simultaneous resolvability in graph families
- On the fractional strong metric dimension of graphs
- Closed formulae for the strong metric dimension of lexicographic product graphs
- On the strong metric dimension of Cartesian and direct products of graphs
- The fractional metric dimension of graphs
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
- The (weighted) metric dimension of graphs: hard and easy cases
- Resolvability and strong resolvability in the direct product of graphs
- On optimal approximability results for computing the strong metric dimension
- On families of convex polytopes with constant metric dimension
- Mastermind
- The strong metric dimension of graphs and digraphs
- Resolvability in graphs and the metric dimension of a graph
- The fractional strong metric dimension in three graph products
- Strong resolving graphs: the realization and the characterization problems
- The strong metric dimension of the power graph of a finite group
- Mixed metric dimension of graphs
- On the strong metric dimension of corona product graphs and join graphs
- On the strong metric dimension of the strong products of graphs
- The solid-metric dimension
- On strong metric dimension of graphs and their complements
- Landmarks in graphs
- Variable neighborhood search for the strong metric dimension problem
- The Fractional Strong Metric Dimension of Graphs
- ON THE STRONG METRIC DIMENSION OF SOME RELATED WHEEL GRAPH
- Strong metric dimension: A survey
- On the Strong Metric Dimension of Cartesian Sum Graphs
- On the Metric Dimension of Cartesian Products of Graphs
- Computing strong metric dimension of some special classes of graphs by genetic algorithms
- Resolving domination in graphs
- The independent resolving number of a graph
- The strong metric dimension of generalized Sierpiński graphs with pendant vertices
- Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
- On Metric Generators of Graphs
- A Combinatory Detection Problem
- Strong metric dimension of rooted product graphs
This page was built for publication: On the geodesic identification of vertices in convex plane graphs